The previous chapter presented AVL trees. These trees are extremely useful when many fast lookups are needed.
In this chapter, we present another important tree structure, Heap. A heap tree is another balanced tree type with the largest item in the tree always in the root of the tree. We use a heap tree to implement an efficient sorting algorithm.
In the next section, we define heap tree and illustrate heap tree construction.
11.1 Heap Tree Construction
A heap is a complete binary tree such that each node ...
