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

struct Node {  // LINKED LIST NODE
    int          value;
    struct Node* next;
};

int main(int argc, char* argv[]) {
    // Create a linked list of size 2.

    // First node in any linked list is called the "head".
    struct Node* head = malloc(sizeof(*head));
    head -> value = 10;
    head -> next  = NULL;   // IMPORTANT:  The last node in a linked list
                            //             must have .next = NULL.

    struct Node* new_node = malloc(sizeof(*new_node));
    new_node -> value = 11;
    new_node -> next  = NULL;
    head -> next = new_node;
    // Last node in a linked list is always called the "tail".
    
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */