Identify the correct definition of Priority queue.
- A. A node structure that contains a pointer or reference to another node of the same type, forming the basis of linked structures.
- B. An abstract data structure where each element has a priority, and elements are served according to that priority rather than arrival order. ✓
- C. A collision resolution technique in hashing that searches sequentially for the next open slot in the table.
- D. A way of representing a graph using a 2D matrix where each cell indicates whether an edge exists between two vertices.
Correct answer
B. An abstract data structure where each element has a priority, and elements are served according to that priority rather than arrival order.
Explanation
Priority queue refers to an abstract data structure where each element has a priority, and elements are served according to that priority rather than arrival order.