Made easy workbook question

Question

Q.which of the following data structure cannot be used for efficient implementation of Priority Queue?

a. Binary heap

b. Height balanced binary tree.

c. Sorted array

Answer 1

Priority queue can be implemented using an array, a linked list, a heap data structure, or a binary search tree. Among these data structures, heap data structure provides an efficient implementation of priority queues.