int PostOrderGetHeight(BinTree BT)
{
int HL,HR,MAXH;
if(BT)
{
//求左子数的深度
HL=PostOrderGetHeight(BT->Left);
//求右子数的深度
HR = PostOrderGetHeight(BT->Right);
//取左右子树中较大的深度
MaxH = (HL>HR)?HL:HR;
//返货树的深度。
return (MaxH+1);
}
ele
return 0;
}
求二叉树高度
最新推荐文章于 2021-11-18 01:26:52 发布