Data Abstract Structures Labuild a Max Heap CPP Project 10.6 Lab: Heap – Build a max-heap (of integers) This program will read integers from the keyboard,

Data Abstract Structures Labuild a Max Heap CPP Project 10.6 Lab: Heap – Build a max-heap (of integers)

This program will read integers from the keyboard, insert them into a max-heap, and display them as they are deleted from the heap. Most of the code is given:

Heap.h
Heap.cpp
main.cpp

Your task is to finish defining four function in Heap.cpp:

insertHeap
deleteHeap
_reHeapUp
_reHeapDown
10.7 Lab: Heap – Build a min-heap (of integers)

Change the previous lab to work with a min-heap instead of a max-heap.

This program will read integers from the keyboard, insert them into a min-heap, and display them as they are deleted from the heap. Most of the code is given:

Heap.h
Heap.cpp
main.cpp

Your task is to finish defining four function in Heap.cpp:

insertHeap
deleteHeap
_reHeapUp
_reHeapDow
10.8 Lab: Heap – Display Heap as an Indented List

Change the previous lab to display a min-heap as an indented list (level numbers included). In order to do this you will have to add two new member functions of the heap class

- void _printIndented(int index, void visit(int, int)); // A
- void printIndented(void visit(int, int)); // B

None: One function would be sufficient(A). However, to make the call simpler, a wrapper function (B) has been added (to “hide” the root of the heap).

10.9 Lab: Heap – Build min/max-heaps (of integers)

Generalize one of the previous labs to build a min-heap or a max-heap using the same heap functions. Hint: a pointer to a compare function. In main() you are passing either compareMin or compareMax to the insertHeap function:

minHeap.insertHeap(num, compareMin);
maxHeap.insertHeap(num, compareMax);


You also have to update the following functions in the Heap class:

bool insertHeap(int itemIn);
bool deleteHeap(int &itemOut);
void _reHeapUp(int lastndx);
void _reHeapDown(int rootndx);


This program will:

read integers from the keyboard and insert them into a min-heap and a max-heap
display the integers as they are deleted from the min-heap.
display the integers as they are deleted from the max-heap.