C++ Data Structures: A Laboratory Course, 3rd Edition

laboratory 11

Heap ADT

Objectives

In this laboratory you

create an implementation of the Heap ADT using an array representation of a tree.

use inheritance to derive a priority queue class from your heap class and develop a simulation of an operating system's task scheduler using a priority queue.

create a heap sort function based on the heap construction techniques used in your implementation of the Heap ADT.

analyze where data items with various ...