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 40 41 42 43 44 45 46 47 48 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
// STEP 0: Original syntax
//
// Problem: (*curr).value is ugly.
// Solution: curr -> value
struct Node {
int value;
struct Node* next;
};
void print_list(struct Node* head) { // print_list(…) now takes address of the head node
struct Node* curr = head;
while(curr != NULL) {
// printf("[%d]", (*curr).value);
printf("[%d]", curr -> value);
// If this is not the tail, then print a '─' to connect to the next node.
if(curr -> next != NULL) {
printf("─");
}
curr = curr -> next;
}
printf("\n");
}
int main(int argc, char* argv[]) {
// First node is traditionally called 'head'.
// NULL is a symbol that means 0, but is used for a non-existant memory address.
// This (↓) is a linked list of size 1.
struct Node head_node = { .value = 5, .next = NULL };
struct Node next_node = { .value = 6, .next = NULL };
// At this point, we have two linked lists of size 1. Let's connect them.
head_node.next = &next_node;
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.