递归实现
二叉树的高度为左右子树两边的高度中的最大值加1
#include<iostream>
using namespace std;
typedef struct TreeNode *BinTree;
typedef BinTree Position;
struct TreeNode
{
int data;
BinTree left;
BinTree right;
};
int GetHeight(BinTree bt)
{
if(bt)
return max(GetHeight(bt->left),GetHeight(bt->right))+1;
return 0;
}