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 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
// LINKED LIST
typedef struct _Node {
int value;
struct _Node* next;
} Node;
int main(int argc, char* argv[]) {
// size==0
Node* head = NULL;
Node* tail = NULL; // You don't always need to keep track of the tail. It helps here.
// size==1
append(10, head, tail); // WRONG - callee (i.e., append(…)) cannot modify variables
// in the caller's (main(…)'s) scope if they are
// passed by value. Need to pass the address.
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2023 Alexander J. Quinn This content is protected and may not be shared, uploaded, or distributed.