Problem 2583 · Medium
Sum each level of a binary tree and keep the k largest level sums in a bounded min-heap.
Open the interactive visualisation