Deques with Heap Order


A deque with heap order is a deque (double-ended queue) such that each item has a real-valued key and the operation of finding an item of minimum key is allowed as well as the usual deque operations. By combining a standard deque implementation with an auxiliary heap (priority queue) it is possible to implement a deque with heap order so that the worst-case… (More)
DOI: 10.1016/0020-0190(86)90028-1


1 Figure or Table

Slides referencing similar topics