求二叉树叶子节点的个数

int GetLeafNodeNum(BinaryTreeNode *pRoot)
{
if (pRoot == NULL)
return 0;
if (pRoot->lchild == NULL && pRoot->rchild == NULL)
return 1;
int numLeft = GetLeafNodeNum(pRoot->lchild);
int numRight = GetLeafNodeNum(pRoot->rchild);

return (numLeft + numRight);
}