Sartaj Sahni
University of Florida
8.1Definition and an Application
Inserting an Element•Removing the Min Element•Initializing an Interval Heap•Complexity of Interval Heap Operations•The Complementary Range Search Problem
Inserting an Element•Removing the Min Element
Inserting an Element•Removing the Min Element
Dual Priority Queues•Total Correspondence•Leaf Correspondence
8.1Definition and an Application
A double-ended priority queue (DEPQ) is a collection of zero or more elements. Each element has a priority or value. The operations performed on a double-ended priority ...
Get Handbook of Data Structures and Applications, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
