Question

Is the priority queue abstract data type.

(a) True

(b) False

This interesting question is from Ternary Heap in chapter Heap of Data Structures & Algorithms I

I had been asked this question in class test.

Answer 1

Correct option is (a) True

To explain: Priority queue is an abstract data type. It is also the extension of the Queue data structure where all the elements have been assigned some priority and on the basis of this priority, the elements are dequeued from the structure.