Heaps / Priority Queues

Use heaps (priority queues) to efficiently find and maintain the smallest or largest elements. Master the size-k heap pattern for top-k problems, the two-heap pattern for medians, and heap-based k-way merge for combining sorted sequences.