Abstract

. We present priority queues that support the operations FindMin, Insert, MakeQueue and Meld in worst case time O(1) and Delete and DeleteMin in worst case time O(log n). They can be implemented on the pointer machine and require linear space. The time bounds are optimal for all implementations where Meld takes worst case time o(n). To our knowledge this is the first priority queue implementation that supports Meld in worst case constant time and DeleteMin in logarithmic time. Introduction We consider the problem of implementing meldable priority queues. The operations that should be supported are: MakeQueue Creates a new empty priority queue. FindMin(Q) Returns the minimum element contained in priority queue Q. Insert(Q; e) Inserts element e into priority queue Q. Meld(Q 1 ; Q 2 ) Melds the priority queues Q 1 and Q 2 to one priority queue and returns the new priority queue. DeleteMin(Q) Deletes the minimum element of Q and returns the element. Delete(Q; e) Deletes element e fr...

Citations