int main()
{PBinTree pbtree;
int i;
int totalSpace = 0;
printf("Please input char to the binatree,@ to exit current node:\n");
pbtree = Create_BinTreeRoot();
printf("Display the binatree data directly:\n");
outputTree(*pbtree,totalSpace);
printf("Please choose the mode you want to operate with the binatree:\n");
printf("1.display 2.preOrder 3.inOrder 4.postOrder 5.leaves 6.free nodes 0 to exit:");
scanf("%d",&i);
while(i>6 || i<0)
{
printf("\nYou choice is illegal please input again:\n");
printf("1.display 2.preOrder 3.inOrder 4.postOrder 5.leaves 6.free nodes 0 to exit:");
scanf("%d",&i);
}
while(i!=0)
{
while(i > 6 || i<0)
{
printf("\nYou choice is illegal please input again:\n");
printf("1.display 2.preOrder 3.inOrder 4.postOrder 5.leaves 6.free nodes 0 to exit:");
scanf("%d",&i);
}
while(i !=0)
{
while(i > 6 || i<0)
{
printf("\nYou choice is illegal please input again:\n");
printf("1.display 2.preOrder 3.inOrder 4.postOrder 5.leaves 6.free nodes 0 to exit:");
scanf("%d",&i);
}
while(i !=6)
{
while(i > 6 || i<0)
{
printf("\nYou choice is illegal please input again:\n");
printf("1.display 2.preOrder 3.inOrder 4.postOrder 5.leaves 6.free nodes 0 to exit:");
scanf("%d",&i);
}
switch(i)
{
case 0 :
printf("\nDealing with the last job, to free all nodes...\n");
freeAllNodes(*pbtree);
printf("All node have been freed successfully\n");
exit(1);
getch();
case 1 :
printf("\nDisplay binatree:\n");
outputTree(*pbtree,totalSpace);
break;
case 2 :
printf("\nData in preOrder:\n");
preOrder(*pbtree);
printf("\n\n");
break;
case 3 :
printf("\nData in inOrder:\n");
inOrder(*pbtree);
printf("\n\n");
break;
case 4 :
printf("\nData in postOrder:\n");
postOrder(*pbtree);
printf("\n\n");
break;
case 5:
printf("\nLeaves:\n");
leaves(*pbtree);
printf("\n\n");
}
printf("Please choose the mode you want to operate with the binatree:\n");
printf("1.display 2.preOrder 3.inOrder 4.postOrder 5.leaves 6.free nodes 0 to exit:");
scanf("%d",&i);
}
if(i==6)
{
printf("\nFree all nodes:\n");
freeAllNodes(*pbtree);
printf("All node have been freed successfully.");
}
printf("\n\nNow creating a new binatree...\n");
printf("Please input char to the binatree,@ to exit current node:\n");
pbtree = Create_BinTreeRoot();
printf("Display the binatree data directly:\n");
outputTree(*pbtree,totalSpace);
printf("Please choose the mode you want to operate with the binatree:\n");
printf("1.display 2.preOrder 3.inOrder 4.postOrder 5.leaves 6.free nodes 0 to exit:");
scanf("%d",&i);
}
}
printf("\nDealing with the last job, to free all nodes\n");
freeAllNodes(*pbtree);
printf("All node have been freed successfully\n");
getch();
return 0;
}
----------------------------------以下是程序的详细分析过程-----------------------------------
二叉树的集合操作
一． 问题的描述和分析
编写一段程序，对二叉树进行复合操作，包括创建一棵二叉树，显示二叉树的树型结构，对创建的二叉树进行先根、中根、后根三种方式进行遍历，并且打印出叶子结点，并且可以随时删除我们创建的二叉树，然后用循环语句将上述的操作封装起来，使之能够进行可重复、连续的操作。
二．算法的设计
要实现上述的功能，我们首先要深刻的了解二叉树的数据结构，然后依据它的特点，着手如何去创建一棵二叉树，然后，用不同的方法对这棵二叉树进行不同的遍历，实现其它的功能，包括用户友好界面的实现等等一系列的后续操作。
