Priority Queue

Rule #3 of Good Algorithm Design: Keep complex information organized in a good data structure.

A data structure that supports insert and delete-min is called a ``priority queue.''


next up previous
Next: Priority Queue for Elevator Up: HEAPS Previous: HEAPS