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

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

struct Node* create_node(int value) {  // WARNING:  We will need to free(…)
    struct Node* new_node = malloc(sizeof(*new_node));
    new_node -> value = value;
    new_node -> next  = NULL;
    return new_node;
}
int main(int argc, char* argv[]) {
    // Create a linked list of size 2.
    struct Node* head = create_node(10);
    head -> next      = create_node(12);

    // Insert a node with 11 after the head.
    struct Node* new_node = create_node(11);
    new_node -> next = head -> next;
    head     -> next = new_node;

    // Delete the entire list.
    while(head != NULL) {   // Do not simply say while(head) { … }
        struct Node* new_head = head -> next;
        free(head);
        head = new_head;
    }

    // Q:  What if we said while(head -> next != NULL)????
    // A:  You would fail to delete the last node because a list of size 1 has
    //     node -> next == NULL.
    // while(head -> next != NULL) {   // Do not simply say while(head) { … }
    //  struct Node* new_head = head -> next;
    //  free(head);
    //  head = new_head;
    // }

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