Only Correct Answer will be rate (20 pts) In this problem you will be working wi

Question

Only Correct Answer will be rate

(20 pts) In this problem you will be working with a dynamically linked binary search tree (BST). Given a class BSTNode with the following private data members: BSTNode *mpLeft; BSTNode *mpRight; string mData; and the following public member functions: BSTNode (const string &newData;) BSTNode *& getLeft) BSTNode*&getRight; string getData) and a class BST with the following private data member BSTNode mpRoot; ropriate recursive insertNode ) method that is a member of the BST class. The function ld accept a reference to a pointer ("a) to a BSTNode and a const reference to the data to insert. The function does not need to return a value. However, no makeNode () function exists.

Explanation / Answer

void insertNode(BSTNode *&temp, const string &data) {
   while(temp != NULL) {
       if(data <= temp->getData()) {
           temp = temp->getLeft();
       } else{
           temp = temp->getRight();
       }
   }
   temp = new BSTNode(data);
}

Related Questions

Navigate

• Browse (All)
• Browse O
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.