1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
// Original syntax
struct Node {
int value;
struct Node* next;
};
void print_list(struct Node* head) { // Naming convention: head is an address
// head_node is an object
printf("[%d]\n", (*head).value);
}
int main(int argc, char* argv[]) {
// Linked list of size 1.
// ∙ Rule: .next of the tail node must be NULL.
struct Node head_node = { .value = 5, .next = NULL };
print_list(&head_node);
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2021 Alexander J. Quinn This content is protected and may not be shared, uploaded, or distributed.