Which data structure is most suitable for implementing a priority queue?
Correct: D
A heap is the most suitable data structure for implementing a priority queue because it provides efficient insertion and deletion of elements with the highest (or lowest) priority in O(log n) time. Arrays and linked lists would require O(n) in the worst case for these operations. While a BST could be used, balancing it to maintain efficiency makes heaps a better choice.