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 loot of tot updated binary tree.you just have to complete the function
Answers
Answered by
1
Answer:
Input Format
You are given a function,
Node * insert (Node * root ,int data) {
}
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
Similar questions