Tags: "leetcode", "binary-tree", "subtree", access_time 2-min read

Edit this post on Github

Subtree With Maximum Average

Given a binary tree, find the subtree with maximum average. Return the root of the subtree. It’s guaranteed that there is only one subtree with maximum average.

Example

Given a binary tree:

        1
    /      \
  -5       11
 /  \     /  \
1    2   4   -2

return the node 11.

Solution

public class Solution {
    private class ResultType {
        public int sum, size;
        public ResultType(int sum, int size) {
            this.sum = sum;
            this.size = size;
        }
    }
    
    private TreeNode subtree = null;
    private ResultType subtreeResult = null;
    
    /**
     * @param root the root of binary tree
     * @return the root of the maximum average of subtree
     */
    public TreeNode findSubtree(TreeNode root) {
        helper(root);
        return subtree;
    }
    
    private ResultType helper(TreeNode root) {
        if (root == null) {
            return new ResultType(0, 0);
        }
        // Divide and conquer
        ResultType left = helper(root.left);
        ResultType right = helper(root.right);
        // construct the result using left subtree, current node and right subtree.
        ResultType result = new ResultType(
            left.sum + right.sum + root.val,
            left.size + right.size + 1
        );
        // Compare every substree's median with subtreeResult
        if (subtree == null ||
            (subtreeResult.sum / subtreeResult.size) < (result.sum / result.size)
        ) {
            subtree = root;
            subtreeResult = result;
        }
        // Return current result, rather than subtreeResult, because subtreeResult is global
        // subtreeResult is returned in the main function findSubtree
        return result;
    }
}