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

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

void insert(int value, BSTNode** a_root) {
    if(*a_root == NULL) {  // If the tree is empty...
        // Create a tree of size 1
        BSTNode* new_node = malloc(sizeof(*new_node));
        *new_node = (BSTNode) { .value = value, .left = NULL, .right = NULL };

        // Replace root with our newly created tree of size 1
        *a_root = new_node;  // fine for tree of size 1
    }
    else if(value < (*a_root) -> value) {  // If value is < value at the root
        // Insert the value into the left subtree of root.
        // BSTNode* left_subtree = (*a_root) -> left;  // BUG!!!
        // insert(value, &left_subtree);               // BUG!!!

        insert(value, &((*a_root) -> left));  // need to modify field within struct object
    }
    else {  // If value is ≥ value at the root
        // Insert the value into the right subtree of root.
        // BSTNode* right_subtree = (*a_root) -> right;  // BUG!!!
        // insert(value, &right_subtree);                // BUG!!!

        insert(value, &((*a_root) -> right));  // need to modify field within struct object
    }
}

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

    insert(4, &root);
    assert(root -> value == 4); // will crash program (intentionally) if condition is false
    assert(root -> left  == NULL);
    assert(root -> right == NULL);
    printf("root -> value == %d\n", root -> value);

    insert(2, &root);
    assert(root -> left -> value == 2);  // mu_check will look similar
    
    // TODO:  Free the BST
    return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */