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
28
29
30
31
32
33
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>

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

int main(int argc, char* argv[]) {
    // Create linked list of size 1
    Node* head = malloc(sizeof *head);
    *head = (Node) { .value = 5, .next = NULL };  // <= INITIALIZE struct on heap like this

    // Create another node.
    Node* next_node = malloc(sizeof *head);
    *next_node = (Node) { .value = 6, .next = NULL };

    // This is NOT connected as one linked list yet.
    // 
    // head        next_node
    //  ↓           ↓
    // [5|NULL]    [6|NULL]

    head -> next = next_node;

    printf("head -> value == %d\n", head -> value);
    printf("head -> next -> value == %d\n", head -> next -> value);

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

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