Package g2501_2600.s2583_kth_largest_sum_in_a_binary_tree

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2583 - Kth Largest Sum in a Binary Tree\.

    Medium

    You are given the root of a binary tree and a positive integer k.

    The level sum in the tree is the sum of the values of the nodes that are on the same level.

    Return the <code>k<sup>th</sup></code> largest level sum in the tree (not necessarily distinct). If there are fewer than k levels in the tree, return -1.

    Note that two nodes are on the same level if they have the same distance from the root.

    Example 1:

    Input: root = 5,8,9,2,1,3,7,4,6, k = 2

    Output: 13

    Explanation: The level sums are the following:

    • Level 1: 5. - Level 2: 8 + 9 = 17.

    • Level 3: 2 + 1 + 3 + 7 = 13.

    • Level 4: 4 + 6 = 10. The 2<sup>nd</sup> largest level sum is 13.

    Example 2:

    Input: root = 1,2,null,3, k = 1

    Output: 3

    Explanation: The largest level sum is 3.

    Constraints:

    • The number of nodes in the tree is n.

    • <code>2 <= n <= 10<sup>5</sup></code>

    • <code>1 <= Node.val <= 10<sup>6</sup></code>

    • 1 &lt;= k &lt;= n

    • 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 Long kthLargestLevelSum(TreeNode root, Integer k)

      • Methods inherited from class java.lang.Object

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