Practice Maximum Level Sum of a Binary Tree
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Medium#1161
LeetCode ProblemMaximum Level Sum of a Binary Tree
Problem Statement
Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on. Return the smallest level x such that the sum of all the values of nodes at level x is maximal.
Source: Maximum Level Sum of a Binary Tree on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
root = [1,7,0,7,-8,null,null]
Output
2
# Example 2
Input
root = [989,null,10250,98693,-89388,null,null,null,-32127]
Output
2
Constraints
The number of nodes in the tree is in the range [1, 10^4].
-10^5 <= Node.val <= 10^5
Related LeetCode Problems
Practice more problems similar to Maximum Level Sum of a Binary Tree.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.