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

// LINKED LIST
// - Introducing -> operator
//
// a -> f  is equivalent to  (*a).f
// 
// a must be the address of a struct object (ex: Node* a).

// Define a struct type called 'struct _Node' and with an alias 'Node'.
typedef struct _Node {
    int value;
    struct _Node* next;
} Node;

int main(int argc, char* argv[]) {
    // Linked list (aka "list") of size==0
    Node* head = NULL;
    Node* tail = NULL;  // don't always have to keep track of tail, but it can be useful.

    Node* new_node = malloc(sizeof(*new_node)); // create one at a time
    new_node -> value = 1;
    new_node -> next = NULL;

    head = new_node;
    tail = new_node;

    // Create second node (.value==2)
    new_node = malloc(sizeof(*new_node));
    new_node -> value = 2;
    new_node -> next = NULL;

    // Connect second node (.value==2) to first node (.value==1)
    head -> next = new_node;

    // Set tail to second node (.value==2), which is now the last node in the list.
    tail = new_node;
    printf("value at first node:  %d\n", new_node -> value);

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