int GetHeight( BinTree BT ){
int hl, hr;
if(!BT)
return 0;
hl = GetHeight(BT->Left);
hr = GetHeight(BT->Right);
int h = 0;
if(hl > hr) h = hl;
else h = hr;
return h + 1;
}
4-12 求二叉树高度
最新推荐文章于 2024-06-19 18:36:28 发布