#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 insert(int value, BSTNode** a_root) {
    BSTNode* new_node = malloc(sizeof(*new_node));
    *new_node = (BSTNode) { .value = value, .left = NULL, .right = NULL };
    *a_root = new_node;
}

int main(int argc, char* argv[]) {
    BSTNode* root = NULL;
    insert(4, &root);
    assert(root != NULL);        // Tree should no longer be empty.
    assert(root -> value == 4);  // Value at root should be 4
    assert(root -> left == NULL);
    assert(root -> right == NULL);
    /*
    insert(2, &root);
    insert(1, &root);
    */
    
    // TODO:  Free memory (i.e., destroy_bst(…))
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */