二叉树之求叶子结点个数

int GetLeafNodeNumber(BiTNode *T)
{
	if (T == NULL)
	{
		return 0;
	}
	if (T->lchild == NULL && T->rchild == NULL)
	{
		return 1;
	}
	return GetLeafNodeNumber(T->lchild) + GetLeafNodeNumber(T->rchild);
}