Smallest Subtree with all the Deepest Nodes

Given a binary tree rooted at root, the depth of each node is the shortest distance to the root.

A node is deepest if it has the largest depth possible among any node in the entire tree.

The subtree of a node is that node, plus the set of all descendants of that node.

Return the node with the largest depth such that it contains all the deepest nodes in its subtree.

Example 1:

Input: [3,5,1,6,2,0,8,null,null,7,4]
Output: [2,7,4]
Explanation:
We return the node with value 2, colored in yellow in the diagram.
The nodes colored in blue are the deepest nodes of the tree.
The input "[3, 5, 1, 6, 2, 0, 8, null, null, 7, 4]" is a serialization of the given tree.
The output "[2, 7, 4]" is a serialization of the subtree rooted at the node with value 2.
Both the input and output have TreeNode type.

思路：divide and conquer，returnType是LCA node,和最深的depth；

注意触底反弹的是最深的depth，depth是从上往下传下去的，最后往上返回的是最深的depth，这也是为什么 leftnode.depth == rightnode.depth 的时候，returnType的depth就是leftnode.depth;

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    private class ReturnType {
        public TreeNode node;
        public int depth;
        public ReturnType(TreeNode node, int depth) {
            this.node = node;
            this.depth = depth;
        }
    }
    
    public TreeNode subtreeWithAllDeepest(TreeNode root) {
        ReturnType res = dfs(root, 0);
        return res.node;
    }
    
    private ReturnType dfs(TreeNode root, int depth) {
        if(root == null) {
            return new ReturnType(root, depth);
        }
        
        ReturnType leftnode = dfs(root.left, depth + 1);
        ReturnType rightnode = dfs(root.right, depth + 1);
        
        if(leftnode.depth > rightnode.depth) {
            return leftnode;
        } else if(leftnode.depth < rightnode.depth) {
            return rightnode;
        } else {
            // leftnode.depth == rightnode.depth
            // 注意这里是return 
            return new ReturnType(root, leftnode.depth);
        }   
    }
}