LeetCode 1120: Maximum Average Subtree Solution

Master LeetCode problem 1120 (Maximum Average Subtree), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

1120. Maximum Average Subtree

Medium

Tree Depth-First Search Binary Tree

Problem Explanation

Explanation:

To solve this problem, we need to find the subtree with the maximum average value. We can achieve this by using a recursive approach to traverse each node in the tree, calculating the sum and count of nodes in each subtree, and updating the maximum average as we go.

We define a helper function dfs to recursively traverse each node in the tree.
In the dfs function, we calculate the sum and count of nodes in the left and right subtrees.
We update the maximum average subtree if the current subtree's average is higher.
Return the sum and count of nodes in the current subtree to the parent node.

Time Complexity: O(N) where N is the number of nodes in the tree. Space Complexity: O(H) where H is the height of the tree.

Solution Code

class Solution {
    double maxAvg = 0.0;

    public double maximumAverageSubtree(TreeNode root) {
        dfs(root);
        return maxAvg;
    }

    private int[] dfs(TreeNode node) {
        if (node == null) {
            return new int[]{0, 0};
        }

        int[] left = dfs(node.left);
        int[] right = dfs(node.right);

        int sum = left[0] + right[0] + node.val;
        int count = left[1] + right[1] + 1;

        double avg = (double) sum / count;
        maxAvg = Math.max(maxAvg, avg);

        return new int[]{sum, count};
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 1120 (Maximum Average Subtree)?

This page provides optimized solutions for LeetCode problem 1120 (Maximum Average Subtree) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 1120 (Maximum Average Subtree)?

The time complexity for LeetCode 1120 (Maximum Average Subtree) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 1120 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 1120 in Java, C++, or Python.

Back to LeetCode Solutions