Write a method int numberLeaves(Node tree) that returns the number of leaves in the binary tree whose root is tree.

Question

What will be an ideal response?


Assuming a Node class

```

class Node
{
int element;
Node left, right;
Node(int el, Node left, Node right)
{
element = el;
this.left = left;
this.right = right;
}
}

```

Answer 1

```

int numberLeaves(Node tree)
{
if (tree == null) return 0;
if (tree.left == null && tree.right == null)
return 1;
else
return numberLeaves(tree.left) + numberLeaves(tree.right);
}


```