Next: 10.1 : An Implicit Up: Open Data Structures (in Previous: 9.4 Discussion and Exercises Contents
In this chapter, we discuss two implementations of the extremely useful
priority
data structure. The first is an implementation based
on arrays. It is very fast and is the basis of one of the fastest
known sorting algorithms, namely heapsort (see Section 11.1.3).
The second implementation is based on binary trees and is more flexible.
In particular, it supports a
operation that allows the priority
queue to absorb the elements of a second priority queue
.
