Document Type
Article
Publication Date
1991
DOI
10.1093/comjnl/34.5.423
Publication Title
Computer Journal
Volume
34
Issue
5
Pages
423-427
Abstract
An implementation of a double-ended priority queue is discussed. This data structure referred to as min–max–pair heap can be built in linear time; the operations Delete-min, Delete-max and Insert take O(log n) time, while Find-min and Find-max run in O(1) time. In contrast to the min-max heaps, it is shown that two min–max–pair heaps can be merged in sublinear time. More precisely, two min–max–pair heaps of sizes n and k can be merged in time O(log (n/k) * log k).
Original Publication Citation
Olariu, S., Overstreet, C. M., & Wen, Z. (1991). A mergeable double-ended priority queue. Computer Journal, 34(5), 423-427. doi:10.1093/comjnl/34.5.423
Repository Citation
Olariu, S., Overstreet, C. M., & Wen, Z. (1991). A mergeable double-ended priority queue. Computer Journal, 34(5), 423-427. doi:10.1093/comjnl/34.5.423
ORCID
0000-0002-3776-216X (Olariu)
Included in
Databases and Information Systems Commons, Software Engineering Commons, Theory and Algorithms Commons
