Leaf nodes ?

Given a binary tree. Write a function which takes the root of the tree and returns the number of leaf nodes present in the binary tree.

struct node
{
int data;
struct node * lChild;
struct node * rChild;
};

int leafNodes(node *root)
{
// Put your code here...
}

int leafNodes(node *root)
{
return root ? ((root->lChild + root->rChild) ? leafNodes(root->lChild) + leafNodes(root->rChild) : 1) : 0;
}

/* ---------- */

int leafNodes(node *root)
{
if(!root)
return 0;
else
return (root->lChild + root->rChild) ? leafNodes(root->lChild) + leafNodes(root->rChild) : 1;
}

/* ---------- */

int leafNodes(node *root)
{
if(!root)
return 0;
else
return (root->lChild == root->rChild) ? 1 : leafNodes(root->lChild) + leafNodes(root->rChild);
}