Heaps

Summary

A tree-based structure that efficiently tracks the min/max element — used for problems involving top-K elements, scheduling, or streaming statistics.

• 1Practice using a heap for top-K and 'k closest' style problems.
• 2Learn Python's `heapq` module (or equivalent) fluently.
• 3Understand when a heap beats sorting the whole array (streaming or partial-order needs).