Priority Queues
← Back to Queues
A queue where each element has a priority. The highest-priority element is dequeued first regardless of insertion order. Typically implemented with a Binary Heap. Used in Dijkstra’s algorithm, task scheduling, and event simulation.