求二叉树高度

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;}