Derive a MinHeap class from the BST class of your Lab 4 code. Define/Override only the Search/Insert/Delete methods in the new class. Write a new main for this lab which: Will only be a test program for the MinHeap. Declares and creates a MinHeap object as necessary. Declares and creates the Dollar objects as necessary. Inserts the 20 Dollar objects specified in Lab 4 in the same order. Performs all 4 traversals after the inserting the 10th and the last objects - in total there will be 8 outputs which should be clearly demarcated. No user input is necessary, no data validation is necessary.

Derive a MinHeap class from the BST class of your Lab 4 code. Define/Override only the Search/Insert/Delete methods in the new class. Write a new main for this lab which: Will only be a test program...

Dec 08, 2021