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

// Print entire list.

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

void print_list(Node* head) {
    // Naïve way
    Node* curr = head;  // 'curr' is a commonly used name for "current node" (like a cursor)
    while(curr != NULL) {
        printf("[%d]", curr -> value);   
        if(curr -> next != NULL) { // If curr is not the tail...
            printf("→");
        }

        curr = curr -> next;   // Once we've printed one, we move to the next.
    }
    printf("\n");
}

int main(int argc, char* argv[]) {
    Node head_node = { .value = 5,  .next = NULL };
    Node next_node = { .value = 6,  .next = NULL };
    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: */