Priority Queue

• A Priority Queue is a linear data structure.
• It has items with its key that support two types of operations.
• Here, key represent a value - we called as priority.
• 1. insert a new item using key
• 2. delete an existing item using key
• The operations can be managed based on two assumptions.
• 1. highest or maximum priority for insert or delete
• 2. lowest or minimum priority for insert or delete

Note: The same priority value can be managed or control by the developer or programmer.

• Application of Priority Queue:
• Simulation system
• Job Scheduling
• Emergency case in Hospital / Fire station