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 <stdbool.h>
#include <assert.h>
#include "miniunit.h"
// Introducing: ASSERT (aka assertions)
typedef struct _BSTNode {
int value;
struct _BSTNode* left;
struct _BSTNode* right;
} BSTNode;
void insert(int value, BSTNode** a_root) {
if(*a_root == NULL) { // If the tree is empty... // Create a tree of size 1
BSTNode* new_node = malloc(sizeof(*new_node));
*new_node = (BSTNode) { .value = value, .left = NULL, .right = NULL };
*a_root = new_node;
assert((*a_root) -> value == value);
assert((*a_root) -> left == NULL && (*a_root) -> right == NULL);
}
else if(value < (*a_root) -> value) {
insert(value, &((*a_root) -> left));
}
else {
assert(value >= (*a_root) -> value);
insert(value, &((*a_root) -> right));
}
}
void destroy_tree(BSTNode** a_root) {
if(*a_root != NULL) {
destroy_tree(&(*a_root) -> left);
destroy_tree(&(*a_root) -> right);
free(*a_root);
*a_root = NULL;
}
assert(*a_root == NULL);
}
int main(int argc, char* argv[]) {
// size == 0 (empty tree)
BSTNode* root = NULL;
insert(4, &root);
insert(2, &root);
destroy_tree(&root);
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2022 Alexander J. Quinn This content is protected and may not be shared, uploaded, or distributed.