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.
(A) Array
(B) Linked List
(C) Heap Data Structures like Binary Heap, Fibonacci Heap
(D) None of the above
Answer: (C)
Explanation: See http://en.wikipedia.org/wiki/Priority_queue
Recommended Posts:
- Introduction to Data Structures | 10 most commonly used Data Structures
- Data Structures | Queue | Question 1
- Data Structures | Queue | Question 2
- Data Structures | Queue | Question 3
- Data Structures | Queue | Question 4
- Data Structures | Queue | Question 6
- Data Structures | Queue | Question 11
- Data Structures | Queue | Question 8
- Data Structures | Queue | Question 11
- Data Structures | Queue | Question 10
- Data Structures | Queue | Question 11
- Difference between Stack and Queue Data Structures
- Reversing a Queue using another Queue
- Data Structures | Linked List | Question 1
- Data Structures | Stack | Question 1
- Data Structures | Stack | Question 2
- Data Structures | Linked List | Question 2
- Data Structures | Linked List | Question 3
- Data Structures | Binary Trees | Question 1
- Data Structures | Tree Traversals | Question 1
