Rewrite method inserthelp() to take advantage of the modified BSTNode in which a pointer can be either a regular pointer or a thread.Modify method printhelp() to work with threaded nodes.Add method printInorder() to do an inorder printing of your tree without the use of recursion.Add printReverse() to do a reverse order printing of your tree without resorting to recursion.You may add private helper methods as needed to make modifying or creating the methods above easier. // multiple records match "k",E* find (const Key& k) const { return findhelp (root, k); }86return an arbitrary one.8788// Return the number of records in the dictionary.int size () { return nodecount; }899091void print () const { // Print the contents of the BSTif (root == NULL) cout << "The BST is empty. \n";else printhelp (root, 0);92939495}9697};98// Visitprints out roottemplate 99100pvoid BST::vist (BSTNode* r) const {" <« r->element () << endl;101102cout << "Node103}104// Clean up BST by releasing space back free storetemplate void BST: :clearhelp (BSTNode* root) {if (root == NULL) return;clearhelp (root->left ());clearhelp (root->right () );105106107108109110111112delete root;113114// Insert a node into the BST, returning the updated treetemplate pBSTNode* BST::inserthelp (BSTNode* root, const Key& k, const E& it) {if (root == NULL)return new BSTNode (k, it, NULL, NULL);if (k < root->key ())root->setLeft (inserthelp (root->left (), k, it));else root->setRight (inserthelp (root->right(), k, it));115116117118119// Empty tree:create node120121122123124return root;// Return tree with node inserted125126// Delete the minimum value from the BST, returning the revised BSTtemplate BSTNode* BST::getmin (BSTNode* rt) {if (rt->left() == NULL)127128129130131132return rt;133else return getmin (rt->left());134135template BSTNode* BST::edeletemin (BSTNode* rt) {if (rt->left () == NULL) // Found minreturn rt->right();136137138139140else {// Continue left141rt->setLeft (deletemin (rt->left () ));142return rt;143144145// Remove a node with key value k// Return: The tree with the node removedtemplate BSTNode* BST::removehelp (BSTNode* rt, const Keys k) {if (rt == NULL) return NULL;146147148149150151// k is not in treeelse if (k < rt->key ())rt->setLeft (removehelp (rt->left (), k));else if (k > rt->key () )rt->setRight (removehelp (rt->right(), k));152153154155156else {// Found: remove itBSTNode* temp =if (rt->left ()rt = rt->right();delete temp;157rt;// Only a right child// so point to right158== NULL) {159160 // Binary Search Tree implementation for the Dictionary ADTtemplate class BST : public Dictionary {private:BSTNode* root;// Root of the BSTint nodecount;// Number of nodes in the BST// Private "helper" functionsvoid clearhelp (BSTNode*);BSTNode* inserthelp (BSTNode*,const Key&, const E&);BSTNode* deletemin (BSTNode*);BSTNode* getmin (BSTNode*);BSTNode* removehelp (BSTNode*, const Key&) ;E* findhelp (BSTNode*, const Key&) const;void printhelp (BSTNode*, int) const;void vist (BSTNode*) const;public:BST () { root = NULL; nodecount = 0; }// Constructor-- I've commented out the destructor//Note from Prof Sipantzi//since you would have to change clearhelp () to make it work with//doubly-threaded trees and that is not part of the assignment.// ~BST () { clearhelp(root); }// Destructorvoid clear()// Reinitialize tree{ clearhelp(root); root = NULL; nodecount = 0; }// Insert a record into the tree.// k Key value of the record.// e The record to insert.void insert(const Key& k, const E& e) {root = inserthelp (root, k, e);nodecount++;}// Remove a record from the tree.// k Key value of record to remove.// Return: The record removed, or NULL if there is none.E* remove (const Key& k) {E* temp =if (temp != NULL) {root = removehelp (root, k);findhelp (root, k);// First find itnodecount--;}return temp;}// Remove and return the root node from the dictionary.// Return: The record removed, null if tree is empty.E* removeAny() { // Delete min valueif (root != NULL) {E* temp = new E;*temp = root->element ();root = removehelp (root, root->key());nodecount--;return temp;}else return NULL;}

Actually, program is a executable software that runs on a computer.

Answered: Rewrite method inserthelp() to take…

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE