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 51 52 53 | #include <stdio.h>
#include <stdlib.h>
#include <assert.h>
struct Node {
int value; // 4 bytes (on our platform)
struct Node* next; // 8 bytes (on our platform)
}; // 12 bytes for a whole node (on our platform)
void print_linked_list_of_ints(struct Node* head) {
for(struct Node* curr = head; curr != NULL; curr = curr -> next) {
printf("curr -> value == %d\n", curr -> value);
}
}
// Let's make this right... STILL NOT QUITE
void append(int value, struct Node** a_head, struct Node** a_tail) {
// create_list_node(value)
struct Node* new_node = malloc(sizeof(*new_node));
new_node -> value = value;
new_node -> next = NULL;
if(*a_tail == NULL) { // If list is empty
*a_tail = new_node;
}
else { // Not empty....
(*a_tail) -> next = new_node;
// BUG: Something is missing right here <<<<<<
}
if(*a_head == NULL) { // If list is empty...
*a_head = new_node;
}
}
int main(int argc, char* argv[]) {
struct Node* head = NULL;
struct Node* tail = NULL;
append(10, &head, &tail);
assert(head == tail);
assert(head -> next == NULL);
append(11, &head, &tail);
printf("head -> next == %p\n", (void*)(head -> next));
assert(head -> next == tail);
assert(tail -> next == NULL);
assert(head -> next -> next == NULL);
append(12, &head, &tail);
print_linked_list_of_ints(head);
// TODO: Free memory before we exit.
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2019 Alexander J. Quinn This content is protected and may not be shared, uploaded, or distributed.