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 54 55 56 57 58 59 60 61 62 63 64 65 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
typedef struct _BSTNode {
int value;
struct _BSTNode* left;
struct _BSTNode* right;
} BSTNode;
void print_bst(BSTNode* root) {
// Do nothing if the tree is empty.
if(root != NULL) {
// Print left subtree.
print_bst(root -> left); // RESURSIVE CALL
// Print value at the root.
printf("[%d] ", root -> value);
// Print right subtree.
print_bst(root -> right); // RESURSIVE CALL
}
}
void insert_into_bst(int value, BSTNode** a_root) {
if(*a_root == NULL) { // If tree is currently empty
// Allocate space
BSTNode* new_node = malloc(sizeof(*new_node));
// Initialize fields in the node object.
*new_node = (BSTNode) { .value = value, .left = NULL, .right = NULL };
// Set the root to our new node.
*a_root = new_node;
}
else if(value < (*a_root) -> value) {
insert_into_bst(value, &((*a_root) -> left));
}
else if(value >= (*a_root) -> value) {
insert_into_bst(value, &((*a_root) -> right));
}
}
void print_bst_pretty(BSTNode* root) {
printf("BST:");
print_bst(root);
printf("\n");
}
int main(int argc, char* argv[]) {
BSTNode* root = NULL; // empty tree
insert_into_bst(4, &root); // size == 1
insert_into_bst(2, &root); // size == 2
insert_into_bst(1, &root); // size == 3
insert_into_bst(3, &root); // size == 4
insert_into_bst(6, &root); // size == 5
insert_into_bst(5, &root);
insert_into_bst(7, &root);
print_bst_pretty(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.