Write a method int depth(Node tree) that returns the length of the longest path that begins at the node tree and ends at any leaf of the binary tree.

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;
}
}

```

```
int depth(Node tree)
{
if (tree == null)
return -1;
else
return 1 + Math.max(depth(tree.left) + depth(tree.right));
}


```