Question

Problem 5. (20 pts total) Write the erase functions for the Mtree class that deletes every node in the Mtree. Note there should be two erase functions. The irst is in the e second is a recursive function in the private section that is called by the function in the public ar Root.) ree-

Please use template <typename T>. This is a C++ Data Structures Question.

Answer 1

Code Screenshot

// public function void erase () /I root points to the root node of the tree erase util (this->root); /MNode is the class that defines the node of the tree // please change the name accordingly void erase util (MNode node) // if the tree is not empty if (node) Itraverse the left subtree // getLeft () return pointer to left child erase util (node->getLeft ) // traverse the right subtree // getLeft () return pointer to right child erase util (node->getRight O) // delete the current node delete node;

Code

// public function

void erase()

{

    // root points to the root node of the tree

    erase_util(this->root);

}

// MNode is the class that defines the node of the tree

// please change the name accordingly

void erase_util(MNode *node)

{

    // if the tree is not empty

    if(!node)

    {

        // traverse the left subtree

        // getLeft() return pointer to left child

        erase_util(node->getLeft());

       

        // traverse the right subtree

        // getLeft() return pointer to right child

        erase_util(node->getRight());

       

        // delete the current node

        delete node;

    }

}