C++练习 | 求解二叉树的高度

int h(BTree *bt)
{
    if(bt->lchild==NULL&&bt->rchild==NULL)
        return 1;
    if(bt->lchild!=NULL&&bt->rchild==NULL)
        return 1+h(bt->lchild);
    if(bt->lchild==NULL&&bt->rchild!=NULL)
        return 1+h(bt->rchild);
    return 1+max(h(bt->rchild),h(bt->lchild));
}