数据结构课程设计：动态查找表

n");printf("*动态查找表*\n");printf("*1.建立二叉排序树*\n");printf("*2.二叉排序树查找元素*\n");printf("*3.二叉排序树插入元素*\n");printf("*4.二叉排序树删除元素*\n");printf("*5.退出*\n");printf("**\n");printf("********************************************************\n");printf("请输入你的选择:\n");scanf("%d",&h);switch(h){case1:Init(T);printf("中序遍历二叉排序树:");Zhongxu(T);printf("\n");break;case2:printf("请输入要查找的数据:\n");scanf("%d",&n);e.key=n;if(Search(T,e,NULL,p))printf("数据已经存在!\n");else{printf("数据不存在!\n");}break;case3:printf("请输入要插入的数据:\n");scanf("%d",&n);e.key=n;if(Search(T,e,NULL,p))printf("已经存在!\n");else{Insert(T,e);printf("成功插入!\n");printf("中序遍历二叉排序树:");Zhongxu(T);printf("\n");}break;case4:printf("请输入要删除的数据:\n");scanf("%d",&n);e.key=n;if(Search(T,e,NULL,p)){Deletebit(T,n);printf("已经成功删除!\n");printf("中序遍历二叉排序树:");Zhongxu(T);printf("\n");}