Overview
A priority queue is a set that allows efficiently removing a maximum or minimum element. A max priority queue is usually implemented with a max-heap and a min priority queue is usually implemented with a min-heap.
Bibliography
- “Abstract Data Type.” In Wikipedia, March 18, 2024. https://en.wikipedia.org/w/index.php?title=Abstract_data_type&oldid=1214359576.
- Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).