intGetHeight(struct TreeNode * tree){if(!tree)//空树return0;int L =GetHeight(tree ->lchild);//求得左子树的高度int R =GetHeight(tree ->rchild);//求得右子树的高度return(L > R ? L : R )+1;}
递归算法求树高代码int GetHeight(struct TreeNode * tree){ if(!tree)//空树 return 0; int L = GetHeight(tree ->lchild);//求得左子树的高度 int R = GetHeight(tree ->rchild);//求得右子树的高度 return (L > R ? L : R ) + 1;}...