Abstract data structure that supports removal of maximum- and minimum-priority elements
3 identifiers linking double-ended priority queue across the web's reference databases
From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0
In computer science, a double-ended priority queue (DEPQ) or double-ended heap or priority deque is a data structure similar to a priority queue or heap, but allows for efficient removal of both the maximum and minimum, according to some ordering on the keys (items) stored in the structure. Every element in a DEPQ has a priority or value. In a DEPQ, it is possible to remove the elements in both ascending as well as descending order.