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>

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

struct Node* create_node(int value) {
    struct Node* new_node = malloc(sizeof(*new_node));
    new_node -> value = value;
    new_node -> next  = NULL;
}
int main(int argc, char* argv[]) {
    // Add a node to make a linked list of size 1.
    struct Node* head = create_node(10);
    
    // Kludgy way first.
    struct Node* new_node = create_node(11);
    head -> next = new_node;
    
    // We now have a linked list of size 2.

    // TODO:  Free memory before we exit.
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */

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