递归算法实现,代码如下:
int GetBinTreeHeight(PBinTree tree)
{
if(tree == NULL) {
return 0;
} else {
int leftHeight = GetBinTreeHeight(tree->leftChild);
int rightHeight = GetBinTreeHeight(tree
递归算法实现,代码如下:
int GetBinTreeHeight(PBinTree tree)
{
if(tree == NULL) {
return 0;
} else {
int leftHeight = GetBinTreeHeight(tree->leftChild);
int rightHeight = GetBinTreeHeight(tree