How to find number of leaves in a heap recursively?

void recursiveleaf( struct heap *p){

if (p==NULL)

return;

if (p->left==NULL && p->right == NULL)

printf ("%d ",p->value);

recursiveleaf(p->right);

recursiveleaf(p->left);

}