Maintains a priority
Max Priority Queue -> Max value will come at first
Min Priority Queue -> Min value will come at first
TC -
Insertion - O(lon n)
Deletion - O( log n)
Priority Queue
Mujahida Joynab - Feb 17 - Mujahida Joynab - Feb 17 - Mujahida Joynab - Feb 17 - Maintains a priority
Max Priority Queue -> Max value will come at first
Min Priority Queue -> Min value will come at first
TC -
Insertion - O(lon n)
Deletion - O( log n)
