6-8 求二叉树高度 (20 分)
本题要求给定二叉树的高度。
函数接口定义:
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
1 #include <iostream> 2 #include <cstdio> 3 #include <cstdlib> 4 using namespace std; 5 typedef char ElementType; 6 typedef struct TNode *Position; 7 typedef Position BinTree; 8 struct TNode{ 9 ElementType Data; 10 BinTree Left; 11 BinTree Right; 12 }; 13 BinTree CreatBinTree();/*实现细节忽略*/ 14 int GetHeight(BinTree BT); 15 16 int main(){ 17 BinTree BT = CreatBinTree(); 18 printf("%d\n", GetHeight(BT)); 19 return 0; 20 } 21 int GetHeight(BinTree BT){ 22 int LD, RD; 23 if(BT == NULL){//空树 24 return 0; 25 }else{ 26 //下面的过程相当与后序遍历 27 LD = GetHeight(BT->Left); 28 RD = GetHeight(BT->Right); 29 return (LD > RD ? LD : RD) + 1; 30 } 31 }