Live briefing
Everything about Double-ended priority queue
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. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Double-ended priority queueA 5-minute orientation
- Pick up a classic book: Fundamentals of data structures in CThe most-reprinted book on the subject
- Read the landmark paper: The deap—a double-ended heap to implement double-ended priority queuesCited 36 times
- Go sideways: Min-max heapA closely related topic
- Go sideways: Priority queueA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The deap—a double-ended heap to implement double-ended priority queues
A Mergeable Double-ended Priority Queue
Symmetric Min-Max heap: A simpler data structure for double-ended priority queue
MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
Two new methods for constructing double-ended priority queues from priority queues
Correspondence-based data structures for double-ended priority queues
Improvements in double ended priority queues
A Double-Ended Priority Queue with O(1) Insertion Amortized Time
đź“š Books worth reading
Fundamentals of data structures in CEllis Horowitz · 1993
Data structures & algorithms in JavaRobert Lafore · 2003
Data Structures and Algorithms in JavaMichael T. Goodrich, Roberto Tamassia · 2014
Fundamentals of data structures in CEllis Horowitz · 2008
Data structures & other objects using C++M. Main · 2001
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Min-max heap In computer science, a min-max heap is a complete binary tree data structure which combines the usefulness of both a min-heap and a max-heap, that is,…
- Priority queue In computer science, a priority queue is an abstract data type similar to a regular queue where each element has an associated priority determining its…
- Cartesian tree In computer science, a Cartesian tree is a binary tree derived from a sequence of distinct numbers. To construct the Cartesian tree, set its root to be…
- Binary heap A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues. The binary…
- Heap (data structure) In computer science, a heap is a tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is the parent node…
- Weak heap In computer science, a weak heap is a data structure for priority queues, combining features of the binary heap and binomial heap. It can be stored in…
- Priority search tree In computer science, a priority search tree is a tree data structure for storing points in two dimensions. It was originally introduced by Edward M. McCreight…
- Randomized meldable heap In computer science, a randomized meldable heap (also Meldable Heap or Randomized Meldable Priority Queue) is a priority queue based data structure in…