Q39
What data structure is best suited for implementing a dynamic priority queue with fast access to the minimum or maximum element?
A.
Hash Table
B.
Stack
C.
Heap
AnswerD.
Linked List
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board