#include "btree.h"

int main(void)
{
    Tree btree;

    ElemType e;
    InitTree(&btree);

    int size = 10;
    char a[] = {'a','b','c','d','e','A','B','C','D','E'};

    if (EmptyTree(&btree))
        printf("It's empty\n");

    for (int i = 0; i < size; i++)
        AddItem(a[i],&btree);
    
    printf("Tree content: %d\n", CountItem(&btree));

    PrintTree(btree.root);
    putchar('\n');
    DeleteItem('c',&btree);
    PrintTree(btree.root);
    putchar('\n');

    ResTree(btree.root);

    return 0;
}