Which data structure is the best for implementing a priority queue? A. Heap B. Array C. Linked list D. Stack Answer Workspace Report Discuss Answer with explanation Answer: Option A Explanation The correct answer is Heap Heap. All the data structures that are given in the above options can be used to implement a priority queue but the most efficient way of implementing a priority queue is a heap data structure. Workspace
Discuss about the question