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.
(B) Linked List
(C) Heap Data Structures like Binary Heap, Fibonacci Heap
(D) None of the above
Explanation: See http://en.wikipedia.org/wiki/Priority_queue