COMP1511 list example

List.c

#include <stdio.h>
#include <stdlib.h>
#include "List.h"

List makeList(void) {
	List l = calloc(1, sizeof(list));
	return l;
}

List addAtHead(List l, int value) {
	Node newNode = calloc(1, sizeof(node));

	newNode->value = value;
	newNode->next = l->head;

	l->head = newNode;

	return l;
}

List deleteFromTail(List l) {
	Node currentNode = l->head;

	if (l->head->next == NULL) {
		free(l->head);
		l->head = NULL;
	} else {
		while (currentNode->next->next != NULL) {
			currentNode = currentNode->next;
		}

		free(currentNode->next);
		currentNode->next = NULL;
	}

	return l;
}

void printList(List l) {
	printf("List: ");

	Node currentNode = l->head;

	while (currentNode != NULL) {
		printf("%d ", currentNode->value);

		currentNode = currentNode->next;
	}

	printf("\n");
}

List.h

typedef struct _node *Node;
typedef struct _list *List;

typedef struct _list {
    Node head;
} list;

typedef struct _node {
    int value;
    Node next;
} node;

List makeList(void);
List addAtHead(List l, int value);
List deleteFromTail(List l);
void printList(List l);

testList.c

#include "List.h"

int main(int argc, char** argv) {
	List l = makeList();

	l = addAtHead(l, 1);
	printList(l);

	l = addAtHead(l, 2);
	printList(l);

	l = addAtHead(l, 3);
	printList(l);

	l = deleteFromTail(l);
	printList(l);

	l = deleteFromTail(l);
	printList(l);

	l = deleteFromTail(l);
	printList(l);
}