//主函數(shù)部分，文件名為bintree.cpp
#include"bitree.h"
void main()
{
	BiTree root;
	int select,max;
	printf("建立二叉樹，輸入字符序列\(zhòng)n");
	CreateBiTree(root);
	do {
		printf("\n1,先序遍歷\n2,中序遍歷序列\(zhòng)n3,后序遍歷序列\(zhòng)n4,計(jì)算葉子個數(shù)\n");
		printf("\n5,二叉樹的高度\n6,中序遍歷序列\(zhòng)n7,后序遍歷序列\(zhòng)n8,計(jì)算葉子個數(shù)\n0,退出 \n");
		scanf("%d",&select);
		switch(select) {
		case 1:
			printf("\n先序遍歷序列\(zhòng)n");
			PreOrderTraverse(root,visit);
			break;
		case 2:
			printf("\n中序遍歷序列\(zhòng)n");
			InOrderTraverse(root,visit);
			break;
		case 3:
			printf("\n后序遍歷序列\(zhòng)n");
			PostOrderTraverse(root,visit);
			break;
		case 4:
			printf("\n計(jì)算葉子個數(shù)\n");
			//PreOrderTraverse(root);
			break;
		case 5:
			printf("\n二叉樹的高度\n");
			max=PostTreeDepth(root);
			printf("%d",max);
			break;
		case 7:
			printf("\n后序遍歷序列\(zhòng)n");
			LinkInOrderTraverse(root,visit);
		case 0:
			break;
		default:
			printf("輸入選項(xiàng)錯誤！請重新輸入！\n");
		}
	} while(select);
}