Question: If a priority queue is being implemented using an unordered list, what is the Big-O complexity of the IsEmpty operation? [1] O(1) [2] O(logN) [3]
If a priority queue is being implemented using an unordered list, what is the Big-O complexity of the IsEmpty operation?
[1] O(1)
[2] O(logN)
[3] O(N)
[4] O(N*N)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
