A priority queue supports insert, peek (min/max), and extract (min/max). It’s typically implemented with a binary heap, giving O(log n) insert/extract and O(1) peek.