MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
1999 ◽
Vol 10
(01)
◽
pp. 1-17
◽
Keyword(s):
We show that the leftist tree data structure may be adapted to obtain data structures that permit the double-ended priority queue operations Insert, DeleteMin, DeleteMax, and Merge to be done in O( log n) time where n is the size of the resulting queue. The operations FindMin and FindMax can be done in O(1) time. Experimental results are also presented.
2011 ◽
Vol 48-49
◽
pp. 767-772
◽
2012 ◽
Vol 3
(2)
◽
pp. 279-283
2010 ◽
Vol 44-47
◽
pp. 3269-3273
Keyword(s):
2014 ◽
Vol 10
(1)
◽
pp. 42-56
◽
2007 ◽
pp. 764-785
2007 ◽
pp. 574-603