//二叉数深度计算int treeDepth(BiTree T){ if(T == null) return 0; else{ int l = treeDepth(T->lchild); int r = treeDepth(T->rchild); return l > r ? l + 1: r + 1; }}