6-8 求二叉树高度

本题要求给定二叉树的高度
函数接口定义：

int GetHeight( BinTree 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;
}
/* 你的代码将被嵌在这里 */

解答:

1. 递归：

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