ConceptTheory & Algos
Priority queue (min heap)
A data structure that allows inserting elements, extracting the minimum element, and updating values in logarithmic time.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.