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

// STEP 0:  Original syntax

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

void print_list(struct Node* head) {  // print_list(…) now takes address of the head node
    struct Node* curr = head;
    while(curr != NULL) {
        printf("[%d]", (*curr).value);
        
        // If this is not the tail, then print a '─' to connect to the next node.
        if((*curr).next != NULL) {
            printf("─");
        }

        curr = (*curr).next;
    }
    printf("\n");
}

int main(int argc, char* argv[]) {

    // First node is traditionally called 'head'.
    // NULL is a symbol that means 0, but is used for a non-existant memory address.
    // This (↓) is a linked list of size 1.
    struct Node head_node = { .value = 5,  .next = NULL };
    struct Node next_node = { .value = 6,  .next = NULL };
    
    // At this point, we have two linked lists of size 1.  Let's connect them.
    
    head_node.next = &next_node;

    print_list(&head_node);
    
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */