Subtree with Maximum Average

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

Notice

LintCode will print the subtree which root is your return node.
It’s guaranteed that there is only one subtree with maximum average.

Have you met this question in a real interview? Yes
Example
Given a binary tree:

 1

/ \
-5 11
/ \ / \
1 2 4 -2
return the node 11.

这道题目没有bug free，
主要思路是：使用ResultType的方式建立存储数据的class，使用traverse和DC的方法进行处理

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
class ResultType {
    int sum, count;
    public ResultType(int sum, int count) {
        this.sum = sum;
        this.count = count;
    }
} 
public class Solution {
    /**
     * @param root the root of binary tree
     * @return the root of the maximum average of subtree
     */
    TreeNode node = null;
    ResultType result = null;
    public TreeNode findSubtree2(TreeNode root) {
        // Write your code here
        util(root);
        return node;
    }
    private ResultType util(TreeNode root) {
        if (root == null) {
            return new ResultType(0, 0);
        }
        ResultType left = util(root.left);
        ResultType right = util(root.right);
        ResultType value = new ResultType(
            left.sum + right.sum + root.val,
            left.count + right.count + 1);
        if (result == null || 
            result.sum * value.count < value.sum * result.count
            ) {
                result = value;
                node = root;
            }
        return value;
    }
}