A priority queue can be implemented using:

• Arrays (sorted or unsorted)
• Linked lists (sorted or unsorted)
• Heap data structure (the most common and efficient way)

A "Fibonacci tree" is not a priority-queue structure. (The structure used for priority queues is a Fibonacci heap.)

So the correct set is (A), (C) and (D).

Answer: (D)