Skip to content

Glossary: Algorithms Beyond the Basics in Java

heap (min-heap)

Also written: min-heap, heap

A structure that always gives you the smallest item first; Java's version is `PriorityQueue`. It picks the nearest place in Dijkstra's algorithm and the earliest end time when counting rooms.

Where the book teaches it

Related terms

PriorityQueueDijkstra's algorithm