Follow all code styling and submission instructions as outlined for previous labs. 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.For submission - upload all class files from Lab 4 as necessary as well as your new MinHeap class and the main. Remember to also include adequate number of screenshots of the program execution.The Discussion forum will be monitored and responded to all week during the Finals. Office Hours will only be held on MTW. For clarifications, post your questions on the Discussion forum first. 昭」く〉h BST copy(+h BST copy) No Selection1 #pragma once/*3Lab 46.7 Group: Lab 3 Team 168.9 Assignment Purpose: To demonstrate that we are able to implement a binary search tree abstract data type.1011*/1213#ifndef BST_H14#define BST_H1516#include "dollar.h"17#include "BSTNode.h"18#include 19#include 2021 using namespace std;2223class BST24{25 public:26//Default constructor27BST()28{29root =nullptr;30}3132//Default destructor33~BST ()3435empty(root);36cout << "BST destructor complete" << endl;37}// Empty operationvoid empty (BSTNode* curNode)38I I39I40{41if (curNodenullptr)==I I42{43return;44}45empty(curNode->left);empty(curNode->right);delete curNode;46474849}50I//Is-Empty methodbool isEmpty);I515253//Search method54BSTNode* search(Dollar key);55//Insert method56void insert(Dollar userNode);57//Delete method58void remove(Dollar key);59//Print methodDollar printNode(BSTNode* targetNode, ofstream targetFile);//Count method6061Line: 1 Col: 1

Here, we have to provide a solution for the above question.

Answered: Follow all code styling and submission…

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

Related questions

Question

Follow all code styling and submission instructions as outlined for previous labs.

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.
For submission - upload all class files from Lab 4 as necessary as well as your new MinHeap class and the main. Remember to also include adequate number of screenshots of the program execution.
The Discussion forum will be monitored and responded to all week during the Finals. Office Hours will only be held on MTW. For clarifications, post your questions on the Discussion forum first.