#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>

typedef struct _BSTNode {
    int value;
    struct _BSTNode* left;
    struct _BSTNode* right;
} BSTNode;

int main(int argc, char* argv[]) {
    // Empty tree (size == 0)
    BSTNode* root = NULL;

    BSTNode* new_node = malloc(sizeof(*new_node));
    *new_node = (BSTNode) { .value = 4, .left = NULL, .right = NULL };
    root = new_node;

    new_node = malloc(sizeof(*new_node));
    *new_node = (BSTNode) { .value = 2, .left = NULL, .right = NULL };
    root -> left = 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 = 3, .left = NULL, .right = NULL };
    root -> left -> right = new_node;
    
    // TODO:  Free memory (i.e., destroy_bst(…))
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */