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 | #include <stdio.h>
#include <stdlib.h>
#include <assert.h>
struct Node {
int value; // on our platform: 4 bytes
struct Node* next; // on our platform: 8 bytes
}; // on our platform: 12 bytes (TOTAL)
// KLUDGY WAY -- NOT GREAT
void append(int value, struct Node** a_head, struct Node** a_tail) {
// Create new node
struct Node* new_node = malloc(sizeof(*new_node));
new_node -> value = value;
new_node -> next = NULL;
if(*a_tail == NULL) { // empty list
*a_tail = new_node;
*a_head = new_node;
}
else { // WARNING: THERE IS A BUG IN HERE
(*a_tail) -> next = new_node;
*a_tail = new_node;
}
}
int main(int argc, char* argv[]) {
struct Node* head = NULL; // This is an empty linked list. size==0
struct Node* tail = NULL;
assert(head == NULL);
// append(10, head); <<<<< WRONG
append(10, &head, &tail);
assert(head != NULL);
assert(head -> value == 10);
assert(head -> next == NULL);
append(11, &head, &tail);
append(12, &head, &tail);
for(struct Node* curr = head; curr != NULL; curr = curr -> next) {
printf("curr -> value = %d\n", curr -> value);
}
// TODO: free(…)
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.