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
27
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>

// LINKED LIST

// Define a struct type called 'struct _Node' and with an alias 'Node'.
typedef struct _Node {
    int value;
    struct _Node* next;
} Node;

int main(int argc, char* argv[]) {
    // Linked list (aka "list") of size==0
    Node* head = NULL;

    Node* new_node = malloc(sizeof(*new_node)); // create one at a time
    (*new_node).value = 1;
    (*new_node).next  = NULL;  // new_node will be the tail (as well as the head)
    head = new_node;

    printf("value at first node:  %d\n", (*new_node).value);
    
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */

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