Algorithm getkeyTofind Declare a variable of type MapEnt nam
Solution
Code for PUT algorithm:
   //This class is to implement bst .
    public class bst {
   
    //Method to put value into root.
 public boolean put(int value) {
        //Checking
 if (root == null) {
 root = new bstnode(value);
 return true;
 } else
 return root.put(value);
 }
    }
    public class bstnode {
 //client class
 public boolean put(int value) {
                //checking value
                if (value == this.value)
 return false;
                    else if (value <this.value) {
                    if (left == null) {
 left = new bstnode(value);
 return true;
 } else
 return left.put(value);
 } else if (value > this.value) {
 if (right == null) {
 right = new bstnode(value);
 return true;
 } else
 return right.put(value);
 }
 return false;
 }
 }
CODE for get Method:
public class bst {
   
 public boolean get(int value) {
 if (root == null)
 return false;
 else
 return root.get(value);
 }
 }
public class bstnode {
 
 public boolean get(int value) {
 if (value == this.value)
 return true;
 else if (value < this.value) {
 if (left == null)
 return false;
 else
 return left.get(value);
 } else if (value > this.value) {
 if (right == null)
 return false;
 else
 return right.get(value);
 }
 return false;
 }
 }


