FindLeafNodes(Tree *root)

{

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

   return 1;

else

 return (FindLeafNodes(root->left) + FindLeafNodes(root->right))

}