Keywords

#double-ended_priority_queue

Double-ended priority queue

In computer science, a double-ended priority queue (DEPQ) or double-ended heap 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.

Mon 13th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Double-ended priority queue Priority queue Double-ended queue Double ended Min-max heap Queue Stack (abstract data type) Collection (abstract data type) Peek (data type operation) Queue (abstract data type)
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.