return m; else
return n; }
//获取二叉树的高度
status HighBitree(BiTree t) {
if (t == NULL)
return 0; else
return HighBitree(t->rchild)); }
5、 主函数
包括:BiTree T,reateBiTree(&T),NumberLeaves(T),printf("%d",HighBitree(T)),PreOrderTraverse(T),InOrderTraverse(T),PostOrderTraverse(T),ArrangementTraverse(T) //主函数 void main() {
BiTree T;
printf("请创建二叉树:\n"); CreateBiTree(&T); NumberLeaves(T); printf("叶节点个数为:"); printf("%d",m);
printf("\n二叉树的高度为:"); printf("%d",HighBitree(T)); printf("\n先序遍历:\n"); PreOrderTraverse(T); /* printf("\n中序遍历:\n"); InOrderTraverse(T); printf("\n后序遍历:\n");
1
+
Max(HighBitree(t->lchild),