main.c

#include <stdio.h>

#include "bst.h"

// TODO: Call destructor when it is implemented

void testSearch() {
    BST* bst = bst_create();
    
    Element contains[] = {50, 43, 3, 48, 61, 58, 70};
    Element notContains[] = {0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 90, 100};

    for (int i = 0; i < 8; i++) {
        printf("%d: %sfound\n", contains[i], bst_search(bst, contains[i]) ? "" : "not ");
    }

    for (int i = 0; i < 12; i++) {
        printf("%d: %sfound\n", notContains[i], bst_search(bst, notContains[i]) ? "" : "not ");
    }

    bst_destroy(bst);
}

void testTraversals() {
    BST* bst = bst_create();

    printf("InOrder: ");
    bst_printInOrder(bst);
    printf("PreOrder: ");
    bst_printPreOrder(bst);
    printf("PostOrder: ");
    bst_printPostOrder(bst);
    printf("\n");

    bst_destroy(bst);
}

void testInsert() {
    BST* bst = bst_create();

    bst_insert(bst, 50);
    bst_insert(bst, 43);
    bst_insert(bst, 3);
    bst_insert(bst, 48);
    bst_insert(bst, 61);
    bst_insert(bst, 58);
    bst_insert(bst, 70);

    bst_print(bst);

    bst_destroy(bst);
}

void testPrint() {
    BST* bst = bst_create();

    bst_print(bst);

    bst_destroy(bst);
}

void testRemove() {
    BST* bst = bst_create();
    Element elements[] = {50, 43, 3, 48, 61, 58, 70};

    for (int i = 0; i < 7; i++) {
        bst_insert(bst, elements[i]);
    }

    bst_print(bst);
    printf("\n");
    bst_remove(bst, 3);
    bst_print(bst);
    printf("\n");
    bst_remove(bst, 43);
    bst_print(bst);
    printf("\n");
    bst_remove(bst, 61);
    bst_print(bst);
    printf("\n");

    // bst_remove(bst, 48);
    // bst_print(bst);
    // printf("\n");

    // bst_remove(bst, 50);
    // bst_print(bst);
    // printf("\n");

    bst_destroy(bst);
}

int main() {
    // testSearch();
    // testTraversals();
    // testPrint();
    // testInsert();
    testRemove();

    return 0;
}