int GetHeight(BinTree BT)
{
if (BT == NULL)
return 0;
int LH, RH;
LH = GetHeight(BT->Left);
RH = GetHeight(BT->Right);
return (LH > RH ? LH : RH) + 1;
}
6-8 求二叉树高度
最新推荐文章于 2023-04-25 20:59:46 发布
int GetHeight(BinTree BT)
{
if (BT == NULL)
return 0;
int LH, RH;
LH = GetHeight(BT->Left);
RH = GetHeight(BT->Right);
return (LH > RH ? LH : RH) + 1;
}