int calcDepth(int item)
{
struct treeNode *temp;
temp=searchItem(root,item);
if (temp==0) return FALSE_VALUE;
else return calcNodeDepth(temp);
}
int calcDepth(int item)//return depth of an item in the tree
{
//write your codes here
struct treeNode * node = 0;
node = searchItem(root, item);
return calcNodeDepth(node);
}
int main(void)
{
//freopen("in2.txt", "r", stdin);
initializeTree();
while(1)
{
//printMenu();
int ch;
scanf("%d",&ch);
if(ch == 1)
{
int item;
scanf("%d", &item);
insertItem(root, item);
}
else if(ch == 2)
{
int item;
scanf("%d", &item);
deleteItem(root, item);
}
else if(ch == 3)
{
int item;
scanf("%d", &item);
struct treeNode * res = searchItem(root, item);
if(res!=0) printf("Found.\n");
else printf("Not found.\n");
}
else if(ch == 4)
{
int height = calcNodeHeight(root);
printf("Height of tree = %d\n", height);
}
else if(ch == 5)
{
int item;
scanf("%d", &item);
int height = calcHeight(item);
printf("Height of %d = %d\n", item, height);
}
else if(ch == 6)
{
int h = calcNodeHeight(root);
printf("\n--------------------------------\n");
printInOrder(root, h);
printf("--------------------------------\n");
}
else if(ch == 7)
{
printf("%d\n", getSize(root));
}
else if(ch == 8)
{
int item;
scanf("%d", &item);
printf("%d\n", calcDepth(item));
}
else if(ch == 9)
{
printf("%d\n", calcNodeDepth(root));
}
else if(ch == 10)
{
if(root == 0) {
printf("tree is empty\n");
continue;
}
printf("%d\n", getMinItem());
}
else if(ch == 11)
{
if(root == 0) {
printf("tree is empty\n");
continue;
}
printf("%d\n", getMaxItem());
}
else if(ch == 12)
{
int left, right;
scanf("%d %d", &left, &right);
printf("%d\n", rangeSearch(root, left, right));
}
else if(ch == 13)
{
int item;
scanf("%d", &item);
//printf("Del : %d\n", item);
//deleteItem(root, item);
printf("%d\n", deleteItem(root, item));
}
else if(ch == 14)
{
break;
}
}
}