数据结构与算法题目集（中文） 6-8 求二叉树高度 (20分)

// #include <stdio.h>
// #include <stdlib.h>

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

// int GetHeight( BinTree BT );

int main()
{
    BinTree BT = CreatBinTree();
    printf("%d\n", GetHeight(BT));
    return 0;
}
int GetHeight( BinTree BT )
{
    int h = 0;
    if (!BT)
    {}
    else if (BT && !BT->Left && !BT->Right)
    {
        h = 1;
    }
    else if (BT->Left&&!BT->Right)  
    {
        h = GetHeight(BT->Left) + 1;
    }
    else if (BT->Right&&!BT->Left)
    {
        h = GetHeight(BT->Right) + 1;
    }
    else
    {
        h = GetHeight (BT->Left) > GetHeight (BT->Right) ? GetHeight(BT->Left) + 1 : GetHeight(BT->Right) + 1;
    }

    return h;
}