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 49 50 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
typedef struct _Node { // always called Node or ▒Node in ECE 26400
int value; // usually called 'value'
struct _Node* next; // address of the next node in the list
} Node; // Think of .next as your link to the next node.
void append(int value, Node** a_head, Node** a_tail) {
Node* new_node = malloc(sizeof(*new_node));
new_node -> value = value;
new_node -> next = NULL;
if(*a_head == NULL) { // If list is empty
*a_head = new_node;
}
else {
(*a_tail) -> next = new_node; // append to end of list
}
*a_tail = new_node;
}
int main(int argc, char* argv[]) {
// size==0 - empty list
Node* head = NULL; // first node in the list is always called 'head'
// size==1
Node* new_node = malloc(sizeof(*new_node)); // declared and allocated
new_node -> value = 10; // equivalent to: (*new_node).value = 5;
new_node -> next = NULL; // equivalent to: (*new_node).next = NULL;
head = new_node; // set the head to the address of the new_node
// size==2
new_node = malloc(sizeof(*new_node));
new_node -> value = 11;
new_node -> next = NULL;
head -> next = new_node;
// Last node in a list is called the "tail".
// [ 10 | → ] → [ 11 | → ] → NULL
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.