Trees_Insertion.java

/*You are given a pointer to the root of a binary search tree and a value to be inserted into the tree. Insert this value into its appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function.

Input Format

You are given a function,

node * insert (node * root ,int value) {

}
node is defined as :

struct node
{
int data;
node * left;
node * right;
}node;
Constraints

No. of nodes in the tree  500
Output Format

Return the root of the binary search tree after inserting the value into the tree.

Sample Input

        4
       / \
      2   7
     / \
    1   3
The value to be inserted is 6.

Sample Output

         4
       /   \
      2     7
     / \   /
    1   3 6
   
*/

 /* Node is defined as :
 class Node 
    int data;
    Node left;
    Node right;
    
    */

static Node Insert(Node root,int value) {


//LOGIC
//RECURSIVE APPROACH,
//IF THE ROOT IS NULL, CREATE A NEW NODE, EQUATE IT TO THE ROOT
//HOWEVER, IF VALUE IS LESS THAN ROOT.DATA, INSERT IN THE LEFT SUBTREE
//IF THE VALUE IS GREATER THAN ROOT.DATA, INSERT IN THE RIGHT SUBTREE
//
    if(root == null) {
       
	 Node newNode = new Node();
        newNode.left = null;
        newNode.right = null;
        newNode.data = value; 
        
	root = newNode;
        }  
    
    if(value > root.data) {
      root.right = Insert(root.right, value);
    }
    
    if(value < root.data) {
    root.left = Insert(root.left, value);
    }
    
    return root;
    
   }