abstract:In computer science, a double-ended priority queue (DEPQ)Data Structures, Algorithms, & Applications in Java: Double-Ended Priority Queues, Sartaj Sahni, 1999. is an abstract data type similar to a priority queue except that it allows for efficient removal of both the maximum and minimum element.