public class Tree {

  TreeNode root;

  public Tree() {
    this.root = null;
  }
  
  int findDeepestNode(TreeNode node, int depth) {
    if (node == null) {
      return depth;
    }

    int leftResult = findDeepestNode(node.left, depth + 1);
    int rightResult = findDeepestNode(node.right, depth + 1);

    if (leftResult >= rightResult) {
      return leftResult;
    } else {
      return rightResult;
    }
  }

  
}