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 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
// 1 FLAW (not a bug) in stack_push(…)
typedef struct _Node {
char ch;
struct _Node* next;
} Node;
void stack_push(Node** a_top, char ch) {
Node* new_top = malloc(sizeof(*new_top)); // NO (Node)malloc(…)! NO sizeof(Node)!
*new_top = (Node) { .ch = ch, .next = NULL }; // Compound literal
if(*a_top != NULL) { // if the stack is NOT intially empty
new_top -> next = *a_top; // make the new top refer to the old top
}
*a_top = new_top;
}
int main(int argc, char* argv[]) {
Node* top = NULL; // empty stack
stack_push(&top, 'A');
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.