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 34 35 36 37 38 39 | #include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <stdbool.h>
#include "clog.h"
// Linked list -- initialize Node with compound initializer
typedef struct _Node { // canonical type name is 'struct _Node'
int value;
struct _Node* next;
} Node; // shortcut (typedef) name is 'Node'
void print_list(Node* head) {
for(Node* curr = head; curr != NULL; curr = curr -> next) {
printf("[%d]", curr -> value);
printf(curr -> next != NULL ? "→" : "\n");
}
}
int main(int argc, char* argv[]) {
// Linked list of size 0
Node* head = NULL;
// Linked list of size 1
Node* new_node = malloc(sizeof(*new_node));
*new_node = (Node) { .value = 10, .next = NULL };
head = new_node;
// Linked list of size 2
new_node = malloc(sizeof(*new_node));
*new_node = (Node) { .value = 11, .next = NULL };
head -> next = new_node; // Connect the head to the new_node.
print_list(head);
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2022 Alexander J. Quinn This content is protected and may not be shared, uploaded, or distributed.