int GetHeight( BinTree BT ){
if (BT){
int l=GetHeight(BT->Left);
int r=GetHeight(BT->Right);
if (l>r) return l+1;
else return r+1;
}
else return 0;
}
求二叉树高度
最新推荐文章于 2022-10-28 21:38:01 发布