Available question text
Compute the sum of node values at each tree level (via BFS/level-order traversal) and return the k-th largest level sum (or -1 if there are fewer than k levels). Because n can be up to 1e5, use an O(n log k) selection like a size-k min-heap or partial sort to efficiently find the k-th largest.
Related questions
Continue with questions that share topics or the same question type.
- Binary Search Tree to Greater Sum Tree
Coding · Binary Search Tree · Binary Tree · Depth-First Search
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- K-th Largest Perfect Subtree Size in Binary Tree
Coding
- Maximum Level Sum of a Binary Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2583. Kth Largest Sum in a Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source