#include <stdio.h>
#include "bst.h"

void traverse(struct node *t, int order) {
    //TODO
}

int main(void) {
    struct node *t = bstNew();

    // Test Case 1: Empty tree
    printf("Empty tree (should print nothing):\n");
    traverse(t, 1);

    // Test Case 2: Single node
    t = bstInsert(t, 12);
    printf("\nSingle node (all orders should print M):\n");

    printf("Preorder:\n");
    traverse(t, 0);

    printf("Inorder:\n");
    traverse(t, 1);

    printf("Postorder:\n");
    traverse(t, 2);

    // Test Case 3: Basic BST
    t = bstInsert(t, 15);
    t = bstInsert(t, 10);

    printf("\nThree-node tree:\n");

    printf("Preorder\n");
    traverse(t, 0);

    printf("Inorder\n");
    traverse(t, 1);

    printf("Postorder\n");
    traverse(t, 2);

    bstFree(t);

    return 0;
}