Topic
-
Tree implementation of a Heap, using an array implementation
of a Binary Tree
-
Insertion, with subsequent restoration of
the Heap
-
Deletion, with subsequent restoration of
the Heap
-
Using a Heap to implement a Priority Queue.
-
The Heap Sort
Readings
Chapter 15, Sections 15.1 and 15.2 only.
