Question

Which of the following statement is true regarding Priority Queue?

• A. It is a data structure
• B. In this, the intrinsic ordering of the element does determine the result of its basic operations
• C. Array implementation of Priority Queue is not possible
• D. All of the above

Answer 1

Answer: (D)

All of the above

Priority queue:-

A priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each element has a "priority" associated with it. In a priority queue, an element with high priority is served before an element with low priority.

In priority queue, the intrinsic ordering of the element does determine the result of its basic operations.

Array implementation of priority queue is not possible.