With what data structure can a priority queue be implemented?
A. Array
B. List
C. Heap
D. Tree
Answer:D
With what data structure can a priority queue be implemented?
A. Array B. List C. Heap D. Tree
Explanation: An array, a list, a binary search tree, or a heap may be used to enforce a priority queue, with the heap being the most effective.