Minimum Subtree

description:
Given a binary tree, find the subtree with minimum sum. 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 minimum sum and the given binary tree is not an empty tree.

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

1

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

bug free
这一道题目要使用dfs的方式进行处理。使用Divide Conquer和Traverse的方式进行联合计算。
中间使用到了打擂台的算法。

/**
 * 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;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root the root of binary tree
     * @return the root of the minimum subtree
     */
    // 题目中要求返回最小值的节点，并不是最小值，以此应该记录最小
    // 值，然后返回该最小值的所对应的节点。以此设定了2个全局变量
    // 如果只是用使用DC的方式，应该建立一个resulttype来处理。
    TreeNode node = null;
    int subTree = Integer.MAX_VALUE;
    public TreeNode findSubtree(TreeNode root) {
        // Write your code here
        util(root);
        return node;
    }
    private int util(TreeNode root) {
        if (root == null) {
            return 0;
        }
        int right = util(root.right);
        int left = util(root.left);
        int sum = right + left + root.val;
        if (sum < subTree) {
            subTree = sum;
            node = root;
        }
        return sum;
    }
}