/*二叉树的结点数目*/
int TreeNodeNum(BiTree T)
{
int num = 0;
if(T == NULL)
{
return 0;
}
else
{
num = TreeNodeNum(T->lchild) + TreeNodeNum(T->rchild) +1;
}
return num;
}
6)主函数
int main()
{
int num = 0;
int depth = 0;
BiTree T = NULL;
CreateBiTree(&T);
printf("\n前序遍历\n");
PreOrderTraverse(T);
printf("\n中序遍历\n");
InOrderTraverse(T);
printf("\n后序遍历\n");
PostOrderTraverse(T);
depth = TreeDepth(T);
printf("\n Tree depth is %d\n",depth);
num = TreeNodeNum(T);
printf("\nTree Node Num is %d\n",num);
destoryiBiTree(&T);
return 0;
}