Run Time Analysis
Underlying data structure: priority queue
Stores set S such that there is a linear order on key values.
Supports operations:
- Insert(x) -- insert element with key value x into set.
- FindMin() -- return value of smallest element in set
- DeleteMin() -- delete smallest element in set.