Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Double-ended priority queue
open-in-new
<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, a double-ended priority queue (DEPQ) or double-ended heap is a <a href="/facts/Data_structure/yNsNvL1I">data structure</a> similar to a <a href="/facts/Priority_queue/1uXVo4Uf">priority queue</a> or <a href="/facts/Heap_(data_structure)/A67B0K7L">heap</a>, but allows for efficient removal of both the maximum and minimum, according to some ordering on the <i>keys</i> (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. </p>