Data Structures | Queue | Question 5
A priority queue can efficiently implemented using which of the following data structures? Assume that the number of insert and peek (operation to see the current highest priority item) and extraction (remove the highest priority item) operations are almost same.
Heap Data Structures like Binary Heap, Fibonacci Heap
None of the above
Heap Data Structures like Binary Heap, Fibonacci Heap would be the answer.
Quiz of this Question
Please comment below if you find anything wrong in the above post
My Personal Notes arrow_drop_up
Please Login to comment...