6-1 二叉树的深度* (10 分)

int CountLeaf(BiTree T, int& count) { if (T == NULL) { return 0; } if (T->left == NULL && T->right == NULL) { count++; } CountLeaf(T->left, count); CountLeaf(T->right, count); return count; } void main() { BiTree(T); int i=1,j=1,choice; while(j) { printf("\n"); printf("\n\t\t"); printf("\n\t\t***************************************"); printf("\n\t\t* 1-------初始化 *"); printf("\n\t\t* 2-------输出中序遍历结果 *"); printf("\n\t\t* 3-------输出前序 *"); printf("\n\t\t* 4-------输出后序 *"); printf("\n\t\t* 5-------计算二叉树的深度 *"); printf("\n\t\t* 6-------统计二叉数的结点个数 *"); printf("\n\t\t* 7-------统计二叉树的叶结点个数 *"); printf("\n\t\t* 0-------返回 *"); printf("\n\t\t***************************************"); printf("\n请选择菜单号（0---7）："); scanf("%d",&choice); switch(choice) { case 1:InOrderTraverse(T); break; case 2:Preorder_Traversal(T); break; case 3:Postorder_Traversal(T); break; case 4:Depth(T); break; case 5:NodeCount(T); break; case 6:CountLeaf(T); break; case 7: j=0; break; } } }