Double ended priority queue
A double ended priority queue supports operations of both max heap (a max priority queue) and min heap (a min priority queue). The following operations are expected from double ended priority queue.
- getMax() : Returns maximum element.
- getMin() : Returns minimum element.
- deleteMax() : Deletes maximum element.
- deleteMin() : Deletes minimum element.
- size() : Returns count of elements.
- isEmpty() : Returns true if the queue is empty.
We can try different data structure like Linked List. In case of linked list, if we maintain elements in sorted order, then time complexity of all operations become O(1) except the operation insert() which takes O(n) time.
We can try two heaps (min heap and max heap). We maintain a pointer of every max heap element in min heap. To get minimum element, we simply return root. To get maximum element, we return root of max heap. To insert an element, we insert in min heap and max heap both. The main idea is to maintain one to one correspondence, so that deleteMin() and deleteMax() can be done in O(Log n) time.
- getMax() : O(1)
- getMin() : O(1)
- deleteMax() : O(Log n)
- deleteMin() : O(Log n)
- size() : O(1)
- isEmpty() : O(1)
Another solution is to use self balancing binary search tree. A self balancing BST is implemented as set in C++ and TreeSet in Java.
- getMax() : O(1)
- getMin() : O(1)
- deleteMax() : O(Log n)
- deleteMin() : O(Log n)
- size() : O(1)
- isEmpty() : O(1)
Below is the implementation of above approach:
C++
// C++ program to implement double-ended // priority queue using self balancing BST. #include <bits/stdc++.h> using namespace std; struct DblEndedPQ { set<int> s; // Returns size of the queue. Works in // O(1) time int size() { return s.size(); } // Returns true if queue is empty. Works // in O(1) time bool isEmpty() { return (s.size() == 0); } // Inserts an element. Works in O(Log n) // time void insert(int x) { s.insert(x); } // Returns minimum element. Works in O(1) // time int getMin() { return *(s.begin()); } // Returns maximum element. Works in O(1) // time int getMax() { return *(s.rbegin()); } // Deletes minimum element. Works in O(Log n) // time void deleteMin() { if (s.size() == 0) return; s.erase(s.begin()); } // Deletes maximum element. Works in O(Log n) // time void deleteMax() { if (s.size() == 0) return; auto it = s.end(); it--; s.erase(it); } }; // Driver code int main() { DblEndedPQ d; d.insert(10); d.insert(50); d.insert(40); d.insert(20); cout << d.getMin() << endl; cout << d.getMax() << endl; d.deleteMax(); cout << d.getMax() << endl; d.deleteMin(); cout << d.getMin() << endl; return 0; } |
Java
// Java program to implement double-ended // priority queue using self balancing BST. import java.util.*; class solution { static class DblEndedPQ { Set<Integer> s; DblEndedPQ() { s= new HashSet<Integer>(); } // Returns size of the queue. Works in // O(1) time int size() { return s.size(); } // Returns true if queue is empty. Works // in O(1) time boolean isEmpty() { return (s.size() == 0); } // Inserts an element. Works in O(Log n) // time void insert(int x) { s.add(x); } // Returns minimum element. Works in O(1) // time int getMin() { return Collections.min(s,null); } // Returns maximum element. Works in O(1) // time int getMax() { return Collections.max(s,null); } // Deletes minimum element. Works in O(Log n) // time void deleteMin() { if (s.size() == 0) return ; s.remove(Collections.min(s,null)); } // Deletes maximum element. Works in O(Log n) // time void deleteMax() { if (s.size() == 0) return ; s.remove(Collections.max(s,null)); } }; // Driver code public static void main(String args[]) { DblEndedPQ d= new DblEndedPQ(); d.insert(10); d.insert(50); d.insert(40); d.insert(20); System.out.println( d.getMin() ); System.out.println(d.getMax() ); d.deleteMax(); System.out.println( d.getMax() ); d.deleteMin(); System.out.println( d.getMin() ); } } //contributed by Arnab Kundu |
10 50 40 20
Comparison of Heap and BST solutions
Heap based solution requires O(n) extra space for an extra heap. BST based solution does not require extra space. The advantage of heap based solution is cache friendly.
Recommended Posts:
- Applications of Priority Queue
- Priority Queue | Set 1 (Introduction)
- Priority Queue in Python
- Priority queue of pairs in C++ (Ordered by first)
- Priority Queue using Linked List
- Implementation of Priority Queue in Javascript
- Priority Queue using doubly linked list
- Why is Binary Heap Preferred over BST for Priority Queue?
- How to implement stack using priority queue or heap?
- Priority Queue in C++ Standard Template Library (STL)
- Program for Preemptive Priority CPU Scheduling
- Scheduling priority tasks in limited time and minimizing loss
- Reverse a path in BST using queue
- Heap queue (or heapq) in Python
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : andrew1234



