#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 destroy_tree(BSTNode** a_root) {
    // TODO
}

static void _print_bst_plain(BSTNode* root) {
    if(root != NULL) {
        // Traverse the left subtree.
        _print_bst_plain(root -> left);

        // Print the value at the root.
        printf("[%d] ", root -> value);

        // Traverse the right subtree.
        _print_bst_plain(root -> right);
    }
}

void print_bst(BSTNode* root, char const* label) {
    printf("%s: ", label);
    _print_bst_plain(root);
    printf("\n");
}

void insert(int value, BSTNode** a_root) {
    if(*a_root == NULL) {
    // If tree (or subtree) is empty, then insert the value here.
        BSTNode* new_node = malloc(sizeof(*new_node));
        *new_node = (BSTNode) { .value = value, .left = NULL, .right = NULL };
        *a_root = new_node;
    }
    else if(value < (*a_root) -> value) {  // Should this value go in the left subtree?
        insert(value, &((*a_root) -> left));
    }
    else if(value >= (*a_root) -> value) {  // ... or the right subtree?
        insert(value, &((*a_root) -> right));
    }
}

int main(int argc, char* argv[]) {
    // What if right subtree were empty?
    BSTNode* root = NULL;
    insert(1, &root);
    insert(2, &root);
    insert(3, &root);
    insert(4, &root);
    print_bst(root, "Size == 4");
    
    // TODO:  Free memory (i.e., destroy_bst(…))
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */