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 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
typedef struct _BSTNode { // canonical name "struct _BSTNode:
int value;
struct _BSTNode* left; // size of address is the same
// no matter the type
struct _BSTNode* right;
} BSTNode; // shortcut name "BSTNode"
int main(int argc, char* argv[]) {
// tree of size 0
BSTNode* root = NULL;
// tree of size 1
BSTNode* new_node = malloc(sizeof(*new_node));
*new_node = (BSTNode) {
.value = 6, .left = NULL, .right = NULL
};
root = new_node;
// tree of size 2
new_node = malloc(sizeof(*new_node));
*new_node = (BSTNode) {
.value = 5, .left = NULL, .right = NULL
};
root -> left = new_node;
// tree of size 3
new_node = malloc(sizeof(*new_node));
*new_node = (BSTNode) {
.value = 8, .left = NULL, .right = NULL
};
root -> right = new_node;
// tree of size 4
new_node = malloc(sizeof(*new_node));
*new_node = (BSTNode) {
.value = 2, .left = NULL, .right = NULL
};
root -> left -> left = new_node;
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.