/**
 * 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
     */
    private int minSum = Integer.MAX_VALUE;
    private TreeNode minNode = null;
    public TreeNode findSubtree(TreeNode root) {
        // Write your code here
        findMin(root);
        return minNode;
    }
    
    private int findMin(TreeNode root) {
        if (root == null) {
            return 0;
        }
        
        int left = findMin(root.left);
        int right = findMin(root.right);
        
        int sum = left + right + root.val;
        if (sum < minSum) {
            minSum = sum;
            minNode = root;
        }
        return sum;
    }
}