Function that returns number of nodes from a tree that have the two Esq fields and dir different from null

Question

I have a binary search tree in which I created a function that should return the amount of nodes that have both children (different dir and Esq NULL fields), but my function does not give the expected value.

The order of insertion is as follows: 3,5,2,4,7,0,2,8,7,9 In my view, should return 4, but is only returning the value 3.

int getLeafCount(ArvBinaria  *a){
if(a == NULL)       
return 0;
else if (a->sae != NULL && a->sad!=NULL)      
return 1 + getLeafCount(a->sae)+ getLeafCount(a->sad);   
}