double-ended priority queue

abstract data structure that supports removal of maximum- and minimum-priority elements

Facts

2 properties

Identity

More facts +1
🏷️ Also known as
en double-ended priority queue ar رتل ذو أولوية مزدوج النهاية fa صف الویت دار دوطرفه pl Dwustronna kolejka priorytetowa ru Двусторонняя приоритетная очередь uk Двостороння черга з пріорітетом zh 双端优先队列
🔖 Identifiers · 3
Dictionary of Algorithms and Data Structures ID
doubleendpq
Freebase ID
/m/0dljlxr
Microsoft Academic ID (discontinued)
158682826

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Subclass of 2
Instance of 1
← Different from 1
Press Enter · cited answer in seconds

Summary

double-ended priority queue is an abstract data type[1].

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). double-ended priority queue. Retrieved November 16, 2026, from https://4ort.xyz/entity/double-ended-priority-queue
MLA “double-ended priority queue.” 4ort.xyz Knowledge Graph, 4ort.xyz, 16 Nov. 2026, https://4ort.xyz/entity/double-ended-priority-queue.
BibTeX @misc{4ortxyz_double-ended-priority-queue_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{double-ended priority queue}}, year = {2026}, url = {https://4ort.xyz/entity/double-ended-priority-queue}, note = {Accessed: 2026-11-16}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): double-ended priority queue — https://4ort.xyz/entity/double-ended-priority-queue (retrieved 2026-11-16)

Canonical URL: https://4ort.xyz/entity/double-ended-priority-queue · Last refreshed: