I\'m having problems trying to make the insert part work in my code. I\'m allowe

Question

I'm having problems trying to make the insert part work in my code. I'm allowed to have //private Node mRoot; in my BST constructor. The Node is a private class in BST.

public class BST {
  
   private Node mRoot;  
  
   public BST()
   {
       Node mRoot = new Node ("");
   }  
  
   public void insert(String key)
   {
       Node newNode = new Node(key);
          
       if(key.compareTo(mData) < 0)
       {
           if(mLeft == null)
           {
               mLeft == null);
               newNode.mParent = this;
               return;
           }
           else
           {
               mLeft.insert(key);
           }
       }
       else
       {
           if(mRight == null)
           {
               mRight == null);
               newNode.mParent = this;
               return;
           }
           else
           {
               mRight.insert(key);
           }
       }
   }

   private class Node
   {
       public Node(String data)
       {
           mData = data;
           mParent = null;
           mLeft = mRight = null;
       }
      
       private String mData;
       private Node mParent;
       private Node mLeft;
       private Node mRight;
   }
}

2 public class BST private de mRoot; No 6e public BST Node mRoot new Node 10 11e public void insert (String key) 12 de ne de new Node (key) 13 14 A15 if (key.com To (Data) (0) pare 16 A17 if(mLeft null) 18 0019 mLeft null) A20 wNode this; Paren ne 21 return; 22 else 23 24 mLeft. insert (key) A25 26 27 else 28 29 A30 if (mRight null) 31 mRight null) A33 wNode this; Paren ne 34 return; 35 else 36 37 A38 mRight insert (key) 39 41 42 430 private class Node public Node (String data) Data data Paren null Left mRigh null 50 51 private String mData; 52 private de Paren No 53 private No mLeft; de 54 private de Right No 55 56

Explanation / Answer

package essaydemo;

public class BST {
  
private Node mRoot;
  
public BST()
{
Node mRoot = null;
}
  
public void insert(String key)
{
mRoot = insertRec(mRoot, key);
}
  
Node insertRec(Node node, String key) {
  
/* If the tree is empty, return a new node */
if (node == null) {
node = new Node(key);
return node;
}

/* Otherwise, recur down the tree */
if (key.compareTo(node.mData) < 0)
{
node.mLeft = insertRec(node.mLeft, key);
node.mLeft.mParent = node.mLeft;
}
else if (key.compareTo(node.mData) > 0)
{
node.mRight = insertRec(node.mRight, key);
node.mRight.mParent = node.mRight;
}

/* return the (unchanged) node pointer */
return node;
}
private class Node
{
public Node(String data)
{
mData = data;
mParent = null;
mLeft = mRight = null;
}
  
private String mData;
private Node mParent;
private Node mLeft;
private Node mRight;
}
}

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

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