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 66 67 68 69 70 71 72 73 74 75 76 77 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
typedef struct _BSTNode {
struct _BSTNode* left;
struct _BSTNode* right;
int value;
} BSTNode;
// if you include level and side for a pre-order print,
// can be good for debugging your tree strucutre
void print_pre_order(BSTNode* root, int level, char side) {
if (root != NULL) {
for (int i = 0; i < level; i++) {
fputc(' ', stdout);
}
printf("%c: %d\n", side, root->value);
print_pre_order(root->left, level + 1, 'L');
print_pre_order(root->right, level + 1, 'R');
}
}
// best for printing the full sorted tree, or transferring it to
// an array
void print_in_order(BSTNode* root) {
if (root != NULL) {
print_in_order(root->left);
printf("%d\n", root->value);
print_in_order(root->right);
}
}
void destroy_bst(BSTNode* root) {
if (root != NULL) {
destroy_bst(root->left);
destroy_bst(root->right);
free(root);
}
}
int main(int argc, char* argv[]) {
BSTNode* root = NULL;
BSTNode* new_node = malloc(sizeof(*new_node));
*new_node = (BSTNode) { .value = 5, .left = NULL, .right = NULL };
root = new_node;
new_node = malloc(sizeof(*new_node));
*new_node = (BSTNode) { .value = 3, .left = NULL, .right = NULL };
root->left = new_node;
new_node = malloc(sizeof(*new_node));
*new_node = (BSTNode) { .value = 8, .left = NULL, .right = NULL };
root->right = new_node;
new_node = malloc(sizeof(*new_node));
*new_node = (BSTNode) { .value = 1, .left = NULL, .right = NULL };
root->left->left = new_node;
new_node = malloc(sizeof(*new_node));
*new_node = (BSTNode) { .value = 4, .left = NULL, .right = NULL };
root->left->right = new_node;
new_node = malloc(sizeof(*new_node));
*new_node = (BSTNode) { .value = 9, .left = NULL, .right = NULL };
root->right->right = new_node;
print_pre_order(root, 0, 'R');
print_in_order(root);
destroy_bst(root);
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2024 Alexander J. Quinn & David Burnett This content is protected and may not be shared, uploaded, or distributed.