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 | #include <stdio.h>
#include <stdlib.h>
#include <assert.h>
struct Node {
int value;
struct Node* next;
};
// KLUDGY WAY -- NOT GREAT
void append(int value, struct Node** a_head) { // BROKEN
// Create new node
struct Node* new_node = malloc(sizeof(*new_node));
new_node -> value = value;
new_node -> next = NULL;
// Add new node to the end of the list
struct Node* tail = *a_head; // VERBOSE!!!!
while(tail != NULL) { // won't work as is
tail = tail -> next;
}
tail = new_node; // BROKEN!!!
}
int main(int argc, char* argv[]) {
struct Node* head = NULL; // This is an empty linked list. size==0
assert(head == NULL);
// append(10, head); <<<<< WRONG
append(10, &head);
assert(head != NULL);
//append(11, …);
//append(12, …);
// 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.