You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their 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 data) {

}

Constraints

No. of nodes in the tree $\leq$ 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

见题面

见题面