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

typedef struct _Node {   // always called Node or ▒Node in ECE 26400
    int value;           // usually called 'value'
    struct _Node* next;  // address of the next node in the list
} Node;                  // Think of .next as your link to the next node.

int main(int argc, char* argv[]) {
    // size==0  - empty list
    Node* head = NULL;   // first node in the list is always called 'head'

    // size==1
    Node* new_node = malloc(sizeof(*new_node));  // declared and allocated
    (*new_node).value = 5;
    (*new_node).next = NULL;   // means this is the end of the list
    
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */