Priority Queue
Jump to navigation
Jump to search
A priority queue is a key-value data structure similar to its FIFO counterpart, but determines dequeue order based on a priority key.
Functions
Implementations
Analysis
| [ template ] Abstract Data Types (ADTs) | |
|---|---|
| Ordered Access to Elements | Stack • Queue • Double-Ended Queue (Deque) |
| Random Access to Elements | Vector • List • Sequence |
| Key/Value Pairs | Tree • Binary Tree • Priority Queue • Heap • Dictionary • Skip List |
| Sorted Storage | Binary Search Tree • AVL Tree • Red-Black Tree |