No Access
MERGEABLE DOUBLE-ENDED PRIORITY QUEUES
https://doi.org/10.1142/S0129054199000022Cited by:6 (Source: Crossref)
Abstract
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.
This work was supported in part by the Army Research Office under grant DAA H04-95-1-0111.
