Which of the following data structures is most suitable for implementing a priority queue?

Answer:

Explanation:

A heap is the most suitable data structure for implementing a priority queue because it allows efficient retrieval of the highest (or lowest) priority element. Heaps provide logarithmic time O(log n) for insertion and deletion operations.

In a priority queue, elements are dequeued based on their priority rather than their order of arrival. Heaps are commonly used to maintain such order efficiently.

A binary heap, in particular, is widely used for implementing priority queues due to its structure and the efficiency it provides for maintaining the order of priorities.