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

// LINKED LIST

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

void append(int value, Node** a_head, Node** a_tail) {
    Node* new_tail = malloc(sizeof(*new_tail));
    new_tail -> value = value;  // same as `(*new_tail).value = value`
    new_tail -> next  = NULL;
    
    *a_head = new_tail;
    *a_tail = new_tail;

    assert(*a_head != NULL && *a_tail != NULL);  // Sanity check: list is not empty anymore
}

int main(int argc, char* argv[]) {
    // size==0
    Node* head = NULL;
    Node* tail = NULL;  // You don't always need to keep track of the tail.  It helps here.

    // size==1
    append(10, &head, &tail); // Pass address of head and tail so they can be modified.
    assert(head != NULL && tail != NULL); // Sanity check: list is no longer empty
    assert(head == tail);                 // Sanity check: head and tail are same (size==1)
    assert(head -> value == 10);          // Sanity check: head's value is 10
    
    // size==2
    append(11, &head, &tail);
    assert(head != tail);                 // Sanity check: head and tail are same (size==1)
                                          // Will fail for now because append(…) not done.
    assert(head -> value == 10);          // Sanity check: head's value is 10
    assert(tail -> value == 11);          // Sanity check: tail's value is 11
    assert(tail -> next  == NULL);

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