c/dataStructure/树/main.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

#include "btree.h"

int main(void)
{
    Tree btree;

    ElemType e;
    InitTree(&btree);

    int size = 10;
    char a[] = {'A','a','B','b','C','c','D','d','E','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');

    ResTree(btree.root);

    return 0;
}