The concept in which an abstract data structure where each element has a priority, and elements are served according to that priority rather than arrival order is best known as which of these terms?
- A. Skip list
- B. Priority queue ✓
- C. Adjacency list
- D. Sparse matrix
Correct answer
B. Priority queue
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.