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>
struct Node {
int value;
struct Node* next;
};
int main(int argc, char* argv[]) {
// Create EMPTY linked list (size 0)
struct Node* head = NULL; // NULL is a constant that means no address
// Add a node to make a linked list of size 1.
head = malloc(sizeof(*head));
head -> value = 10;
head -> next = NULL;
struct Node* new_node = malloc(sizeof(*new_node));
new_node -> value = 11;
new_node -> next = NULL;
head -> next = new_node;
// 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.