求叶子结点数的函数怎么不对?

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