EASY JAVA SOLUTION
Code\n\n/**\n * Definition for a binary tree node.\n * public class TreeNode {\n *     int val;\n *     TreeNode left;\n *     TreeNode right;\n *     TreeNode(
# Code\n```\n/**\n * Definition for a binary tree node.\n * public class TreeNode {\n *     int val;\n *     TreeNode left;\n *     TreeNode right;\n *     TreeNode() {}\n *     TreeNode(int val) { this.val = val; }\n *     TreeNode(int val, TreeNode left, TreeNode right) {\n *         this.val = val;\n *         this.left = left;\n *         this.right = right;\n *     }\n * }\n */\nclass Solution {\n    public TreeNode subtreeWithAllDeepest(TreeNode root) {\n        if(root==null)return null;\n        int lh=height(root.left);\n        int rh=height(root.right);\n        if(lh==rh)return root;\n        else if(lh>rh)return subtreeWithAllDeepest(root.left);\n        else return subtreeWithAllDeepest(root.right);\n    }\n    public int height(TreeNode root)\n    {\n        if(root==null)return 0;\n        return (int)Math.max(height(root.left),height(root.right))+1;\n    }\n}\n```
['Binary Tree', 'Java']