求二叉树节点总数

int GetNodeNum(Node *pRoot)
{
    if (!pRoot)
        return 0;
    return GetNodeNum(pRoot->pLeft) + GetNodeNum(pRoot->pRight) + 1;
}

EOF