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)
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)
For further actions, you may consider blocking this person and/or reporting abuse
Top comments (0)