6-8 求二叉树高度 (20 分)

本题要求给定二叉树的高度。

函数接口定义：

```cpp
int GetHeight( BinTree BT );
其中BinTree结构定义如下：

typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
    ElementType Data;
    BinTree Left;
    BinTree Right;
};
要求函数返回给定二叉树BT的高度值。

裁判测试程序样例：
#include <stdio.h>
#include <stdlib.h>

typedef char ElementType;
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
    ElementType Data;
    BinTree Left;
    BinTree Right;
};

BinTree CreatBinTree(); /* 实现细节忽略 */
int GetHeight( BinTree BT );

int main()
{
    BinTree BT = CreatBinTree();
    printf("%d\n", GetHeight(BT));
    return 0;
}
/* 你的代码将被嵌在这里 */

输出样例（对于图中给出的树）：


4

```cpp

```cpp
#include <stdio.h>
#include <stdlib.h>

typedef char ElementType;
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
    ElementType Data;
    BinTree Left;
    BinTree Right;
};

BinTree CreatBinTree(); /* 实现细节忽略 */
int GetHeight( BinTree BT );

int main()
{
    BinTree BT = CreatBinTree();
    printf("%d\n", GetHeight(BT));
    return 0;
}
int GetHeight( BinTree BT)
{

	int lengthL = 0;
	int lengthR = 0;
    if (BT == NULL)
    {
        return 0;
    }
	else
    {
        lengthL ++;
	    lengthR ++;
        lengthL += GetHeight(BT->Left);
        lengthR += GetHeight(BT->Right);
        int max = lengthL;
        if (lengthR > lengthL)
        max = lengthR;
        return max; 
    }
}
BinTree CreatBinTree(){
	char ch;
	TNode * t;
	scanf("%c",&ch);
	getchar();//吃掉回车
	if(ch=='#'){
		return NULL;
	}
	else
	{
		t=(TNode *)malloc(sizeof(TNode));
		t->Data=ch;
		printf("%c:",ch);
		t->Left = CreatBinTree();
		printf("%c:",ch);
		t->Right =CreatBinTree();
		return t;
	}
}