Fast Meldable Priority Queues

Abstract

We present priority queues that support the operations MakeQueue,<br />FindMin, Insert and Meld in worst case time O(1) and Delete and<br />DeleteMin in worst case time O(log n). They can be implemented on the<br />pointer machine and require linear space. The time bounds are optimal for<br />all implementations where Meld takes worst case time o(n).<br />To our knowledge this is the first priority queue implementation that<br />supports Meld in worst case constant time and DeleteMin in logarithmic<br />time.