Leetcode Problem 2583. Kth Largest Sum in a Binary Tree

2583. Kth Largest Sum in a Binary Tree

Leetcode Solutions

BFS with Priority Queue

Initialize a priority queue (min-heap) to store the level sums.
Perform a BFS traversal of the tree using a queue.
For each level, calculate the sum of node values at that level.
Add the level sum to the priority queue.
If the size of the priority queue exceeds k, pop the smallest element.
After the traversal, check if we have k level sums in the priority queue.
If we do, return the top element of the priority queue; otherwise, return -1.

BFS with Sorting

Ask Question

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen

Loading...

Suggested Answer

Answer

Full Screen

Copy Answer Code

Loading...