Description: Many applications require that we process records with keys in order, but not necessarily in full sorted order.
Often we collect a set of items and process the one with the current minimum value.
e.g. jobs sent to a printer,
Operating system job scheduler in a multi-user environment.
Simulation environments
An appropriate data structure is called a priority queue.
To Search:
File list (Check if you may need any files):
Heaps.ppt
Download