Subtree with Maximum Average

Given a binary tree, find the subtree with maximum average. Return the root of the subtree.

此题需要返回的值不止一个，因此使用了一个包含返回值的内部类，通过ResultType来返回参数。高阶版的traverse + divide conquer，需要好好理解一下。

public class Solution {
    /**
     * @param root the root of binary tree
     * @return the root of the maximum average of subtree
     */
    private class ResultType {
        int sum;
        int size;
        public ResultType (int sum, int size) {
            this.sum = sum;
            this.size = size;
        }
    }
    TreeNode node = null;
    ResultType subResult = null;
    public TreeNode findSubtree2(TreeNode root) {
        helper(root);
        return node;
    }
    private ResultType helper(TreeNode root) {
        if (root == null) {
            return new ResultType(0, 0);
        }
        ResultType left = helper(root.left);
        ResultType right = helper(root.right);
        ResultType result = new ResultType(left.sum + right.sum + root.val, 
                            left.size + right.size + 1);
        if (node == null || result.sum * subResult.size > result.size * subResult.sum) {
            subResult = result;
            node = root;
        }
        return result;
    }
}