Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02287136n
Noun Concept
Categories: Priority queues, Heaps (data structures), Abstract data types
EN
double-ended priority queue  DEPQ  double-ended heap  Double ended heaps  interval heap
EN
In computer science, a double-ended priority queue 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 stored in the structure. Wikipedia
Definitions
Sources
EN
In computer science, a double-ended priority queue 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 stored in the structure. Wikipedia
Wikipedia
EN
double-ended priority queue
Wikidata
EN
Double-ended priority queue
Wikipedia Redirections
EN
DEPQ, double-ended heap, Double ended heaps (deaps), interval heap

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License