去左右子树的最大高度然后加上根节点即为树的高度
int GetHeight( BinTree BT )
{
int Hl,Hr,MaxH;
if(BT){
Hl = GetHeight(BT->Left);
Hr = GetHeight(BT->Right);
MaxH = (Hl>Hr) ? Hl : Hr;
return (MaxH+1);
}
else
return 0;
}
去左右子树的最大高度然后加上根节点即为树的高度
int GetHeight( BinTree BT )
{
int Hl,Hr,MaxH;
if(BT){
Hl = GetHeight(BT->Left);
Hr = GetHeight(BT->Right);
MaxH = (Hl>Hr) ? Hl : Hr;
return (MaxH+1);
}
else
return 0;
}