Double-Ended Priority Queues

Authored by: Sartaj Sahni

Handbook of Data Structures and Applications

Print publication date:  March  2018
Online publication date:  February  2018

Print ISBN: 9781498701853
eBook ISBN: 9781315119335
Adobe ISBN:

10.1201/9781315119335-8

 Download Chapter

 

Abstract

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 queue are:

getMin( ) …return element with minimum priority

getMax( ) …return element with maximum priority

put(x) …insert the element x into the DEPQ

removeMin( ) …remove an element with minimum priority and return this element

removeMax( ) …remove an element with maximum priority and return this element

 Cite
Search for more...
Back to top

Use of cookies on this website

We are using cookies to provide statistics that help us give you the best experience of our site. You can find out more in our Privacy Policy. By continuing to use the site you are agreeing to our use of cookies.