Answer:
A priority queue is essentially a list of items in which each item has associated with it a priority
Items are inserted into a priority queue in any, arbitrary order. However, items are withdrawn from a priority queue in order of their priorities starting with the highest priority item first.
Priority queues are often used in the implementation of algorithms
Items are inserted into a priority queue in any, arbitrary order. However, items are withdrawn from a priority queue in order of their priorities starting with the highest priority item first.
Priority queues are often used in the implementation of algorithms
| Previous Question | Next Question |
| Explain stacks and queues in detail? | Do you know what is a circular singly linked list? |