Package g1101_1200.s1161_maximum_level_sum_of_a_binary_tree

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1161 - Maximum Level Sum of a Binary Tree.

    Medium

    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.

    Example 1:

    Input: root = 1,7,0,7,-8,null,null

    Output: 2

    Explanation:

    Level 1 sum = 1.

    Level 2 sum = 7 + 0 = 7.

    Level 3 sum = 7 + -8 = -1.

    So we return the level with the maximum sum which is level 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 <code>1, 10<sup>4</sup></code>.

    • <code>-10<sup>5</sup><= Node.val <= 10<sup>5</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxLevelSum(TreeNode root)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait