Write a short and efficient recursive function int

Question

The Node class for a Binary Tree contains, amongst others, the following public functions:

Node get LeftChild ();

Node getRightChild ();

int getKey ();

Write a short and efficient recursive function int shortestPath (Node n) that returns the number of links on the shortest path from Node n to a leaf Node. (A leaf Node has no children)