Binary Search Tree : Insertion - Hacker Rank Solution

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;

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 

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

*/


node * insert(node *& root, int value)
   {
          if(!root)
                {
                    root=new node;
                    root->data=value;
                    root->left=root->right=NULL;
            } 
        else 
                insert(root->data > value ? root->left :root->right,value);
    
   return root;
}
-----------------------------------------------------------------------------------