统计二叉树结点-简单的2行代码

int count(BTNode *T)
{
    if(T==NULL)
        return 0;
    else
        return count(T->lchild) + count(T->rchild) + 1;
}