1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
#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) {
    printf("[%d]\n", head.value);
}

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 = { .value = 5,  .next = NULL };
    
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */

© Copyright 2021 Alexander J. Quinn         This content is protected and may not be shared, uploaded, or distributed.