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

// Problem:  Using only local variables limits the number of nodes.

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);   
        if(curr -> next != NULL) { // If curr is not the tail...
            printf("→");
        }
    }
    printf("\n");
}

void _append(int value, Node** a_head, Node** a_tail) {
    Node* new_node = malloc(sizeof(*new_node));
    new_node -> value = value;
    new_node -> next  = NULL;

    if(*a_head == NULL) {  // if list is empty
        assert(*a_tail == NULL);
        *a_head = new_node;
        *a_tail = new_node;
    }
    else {
        (*a_tail) -> next = new_node;
        *a_tail = new_node;
    }
}

int main(int argc, char* argv[]) {
    Node* head = NULL;
    Node* tail = head;
    // We have a linked list of size 0.

    _append(5, &head, &tail);
    _append(6, &head, &tail);
    _append(7, &head, &tail);
    for(int i = 0; i < 15; i++) {
        _append(i, &head, &tail);
    }

    print_list(head);

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