#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>

typedef struct _Node {
    int value;
    struct _Node* next;
} Node;

void print_list(Node* head) {
    for(Node* curr = head; curr != NULL; curr = curr -> next) {
        printf("[%d]→", curr -> value);
    }
    printf("NULL\n");
}

void append(int value, Node** a_head, Node** a_tail) {
    Node* new_tail = malloc(sizeof *new_tail);
    *new_tail = (Node) { .value = value, .next = NULL };
    if(*a_head == NULL) { // If list is empty...
        *a_head = new_tail;
    }
    else {
        (*a_tail) -> next = new_tail;  // connect existing list to new tail
    }
    *a_tail = new_tail;
}

int main(int argc, char* argv[]) {
    // Create linked list of size 0
    Node* head = NULL;
    Node* tail = NULL;
    append(5, &head, &tail);
    append(6, &head, &tail);
    append(7, &head, &tail);

    print_list(head);

    // TODO: free
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */