int GetHeight( BinTree BT ){
if(!BT)
return 0;
else{
int h1=GetHeight(BT->Left);
int h2=GetHeight(BT->Right);
return h1>h2?h1+1:h2+1;
}
}
6-8 求二叉树高度 (20 分)
最新推荐文章于 2021-08-29 20:32:56 发布