Package g2501_2600.s2583_kth_largest_sum_in_a_binary_tree

Class Solution

java.lang.Object
g2501_2600.s2583_kth_largest_sum_in_a_binary_tree.Solution
public class Solution extends java.lang.Object
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 kth 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 2nd 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.
  • 2 <= n <= 105
  • 1 <= Node.val <= 106
  • 1 <= k <= n

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    long
    kthLargestLevelSum(TreeNode root, int k)
     

    Methods inherited from class java.lang.Object

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

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • kthLargestLevelSum

      public long kthLargestLevelSum(TreeNode root, int k)