Glossary: System Design Beyond the Basics in Java
Min-heap
Also written: PriorityQueue, heap
A structure whose `poll()` removes the smallest item. Keeping at most k items and dropping the weakest yields the top k without a full sort.
Glossary: System Design Beyond the Basics in Java
Also written: PriorityQueue, heap
A structure whose `poll()` removes the smallest item. Keeping at most k items and dropping the weakest yields the top k without a full sort.