recursive python solution
```\nclass Solution:\n    def subtreeWithAllDeepest(self, root: TreeNode) -> TreeNode:\n        def helper(node):\n            if not node:\n                ret
```\nclass Solution:\n    def subtreeWithAllDeepest(self, root: TreeNode) -> TreeNode:\n        def helper(node):\n            if not node:\n                return 0, None\n            ld, ln = helper(node.left)\n            rd, rn = helper(node.right)\n            \n            return max(ld, rd) + 1, node if ld == rd else ln if ld > rd else rn\n            \n        return helper(root)[1]
[]