二叉树基本操作+数据结构+实验报告(4)

printf(\谢谢使用-------------------\\n\ scanf(\ switch(j){

case 1:BT=BitTreeInit();printf(\树已经初始化！\\n\ case 2:BitTreeCreat(BT);break; case 3:BitTreeEmpty(BT);break;

11

第 12 页 共 12 页

case 4:PreOrderTraverse(BT);break; case 5:InOrderTraverse(BT);break; case 6:PostOrderTraverse(BT);break;

case 7:l=BinTreeDepth(BT);printf(\树的深度为：%d\\n\ case 8:l=count(BT);printf(\树的结点数为：%d\\n\ case 9:BinTreeClear(BT);printf(\树已经清空！\\n\ case 0:exit(0); } } }

12