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

int GetHeight( BinTree BT );

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

#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

int GetHeight( BinTree BT )
{
    if(BT==NULL)
        return 0;
    else if(BT->Left==NULL&&BT->Right==NULL)
        return 1;
     return (GetHeight(BT->Left)>GetHeight(BT->Right)?GetHeight(BT->Left):GetHeight(BT->Right))+1;
}