int Getheight(BinTree BT)
{
int x1,int x2;
if(BT==NULL)
return 0;
else
{
x1= Getheight(BT->left);
x2= Getheight(BT->right);
if(x1>x2)
return x1+1;
else
return x2+1;
}
}
求树的高度
最新推荐文章于 2021-05-19 19:45:28 发布