Multiway Search Trees and B-Trees
6. Priority Queues
A Priority queue is an important abstract data type in Computer Science.
Major operations supported by priority queues are INSERT and DELETEMIN.
They find extensive use in
Simple ways of implementing a priority queue include:
implementing schedulers in OS, and distributed systems
representing event lists in discrete event simulation
implementing numerous graph algorithms efficiently
selecting kth largest or kth smallest
elements in lists (order statistics problems)
Linked list - sorted and unsorted
Binary search tree