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

// Problem:  (*head).value is UGLY!!!
// Solution:  head -> value
//
// Problem:  struct Node ▒ is too verbose.  I want shorter.
// Solution: Don't be lazy!
//
// Problem:  But I am lazy... and that's not bad.
// Solution: Fine!  Use typedef.
//
// Problem:  Having 'struct Node' and 'Node' in the same program is confusing.
// Solution: Rename 'struct Node' to 'struct _Node'.

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

void print_list(Node* head) {  // Naming convention:  head is an address
                                      //                     head_node is an object
    // printf("[%d]\n", (*head).value);
    printf("[%d]\n", head -> value);
}

int main(int argc, char* argv[]) {
    // Linked list of size 1.
    // ∙ Rule:  .next of the tail node must be NULL.
    Node head_node = { .value = 5,  .next = NULL };
    print_list(&head_node);

    Node next_node = { .value = 6,  .next = NULL };
    // At this point, we have two linked lists of size 1 (each).  Let's connect them!
    
    head_node.next = &next_node;
    // Now, we have a linked list of size 2.

    print_list(&head_node);

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