heap (priority queue with operations) maintains elements with efficient access to the minimum or maximum, supporting insert and extract in . You use it when repeatedly finding the smallest or largest element from a changing collection. Heaps enable sorting and selection of top k elements.
You'll see this in scheduling, merging, and streaming data problems. If you can explain these concepts in your own words, you'll solve related problems faster under interview pressure.
