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 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
// Problem: Using only local variables limits the number of nodes.
typedef struct _Node {
int value;
struct _Node* next;
} Node;
void print_list(Node* head) {
//Node* curr = head; // 'curr' is commonly used name for "current node" (like a cursor)
//while(curr != NULL) {
for(Node* curr = head; curr != NULL; curr = curr -> next) {
printf("[%d]", curr -> value);
if(curr -> next != NULL) { // If curr is not the tail...
printf("→");
}
//curr = curr -> next; // Once we've printed one, we move to the next.
}
printf("\n");
}
int main(int argc, char* argv[]) {
Node head_node = { .value = 5, .next = NULL };
Node next_node = { .value = 6, .next = NULL };
head_node.next = &next_node;
// Now, we have a linked list of size 2.
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.