Live briefing
Everything about Queap
In computer science, a queap is a priority queue data structure. The data structure allows insertions and deletions of arbitrary elements, as well as retrieval of the highest-priority element. Each deletion takes amortized time logarithmic in the number of items that have been in the structure for a longer time than the removed item. Insertions take constant amortized time. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: QueapA 5-minute orientation
- Go sideways: Binomial heapA closely related topic
- Go sideways: Fibonacci heapA closely related topic
📖 Definitions
Noun A priority queue data structure.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- Binomial heap In computer science, a binomial heap is a data structure that acts as a priority queue. It is an example of a mergeable heap (also called meldable heap)…
- Fibonacci heap In computer science, a Fibonacci heap is a data structure for priority queue operations, consisting of a collection of heap-ordered trees. It has a better…
- Shadow heap In computer science, a shadow heap is a mergeable heap data structure which supports efficient heap merging in the amortized sense. More specifically,…
- Brodal queue In computer science, the Brodal queue is a heap/priority queue structure with very low worst case time bounds: O(1) for insertion, find-minimum, meld (merge…
- Iacono's working set structure In computer science, Iacono's working set structure is a comparison based dictionary. It supports insertion, deletion and access operation to maintain…
- Skew binomial heap In computer science, a skew binomial heap (or skew binomial queue) is a data structure for priority queue operations. It is a variant of the binomial heap…
- Van Emde Boas tree A van Emde Boas tree (Dutch pronunciation: [vɑn ˈɛmdə ˈboːɑs]), also known as a vEB tree or van Emde Boas priority queue, is a tree data structure which…
- 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…