double-ended priority queue
abstract data structure that supports removal of maximum- and minimum-priority elements
Facts
2 propertiesIdentity
- Instance of
- abstract data type
More facts +1
- Subclass of
- double-ended queue, priority queue[2][3]
🏷️ 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
🔗 Connections
Subclass of 2
Instance of 1
← Different from 1
Press Enter · cited answer in seconds
0 sources
Summary
double-ended priority queue is an abstract data type[1].