Find Longest Path in Binary Tree

private int findLongestPath(root){
    if(root == null){
      return 0;
    }
    return Math.max(findLongestPath(root.left), findLongestPath(root.right)) +1;
  }
}