**Binary Search Tree : Insertion**

### Problem Statement :

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 <= 500 Output Format Return the root of the binary search tree after inserting the value into the tree.

### Solution :

` ````
Solution in C :
In C++ :
/*
Node is defined as
typedef struct node
{
int data;
node * left;
node * right;
}node;
*/
#include<queue>
queue<node *> Queue;
node * insert(node * root, int value)
{
node *n=new node();
n->data=value;
n->left=NULL;
n->right=NULL;
if(!root){
root=n;
return root;
}
node *temp=root;
while(1){
if(temp->data > n->data){
if(temp->left)
temp=temp->left;
else{
temp->left=n;
break;
}
}
else
{
if(temp->right)
temp=temp->right;
else
{
temp->right=n;
break;
}
}
}
return root;
}
In Java :
/* Node is defined as :
class Node
int data;
Node left;
Node right;
*/
static Node Insert(Node root,int value)
{
if(root == null)
{
root = new Node();
root.data = value;
}
else if(root.data > value)
{
if(root.left == null)
{
Node left = new Node();
left.data = value;
root.left = left;
}
else //keep looking, strictly on left as value is smaller than root
{
Insert(root.left, value);
}
}
else
{
if(root.right == null) //place for value found
{
Node right = new Node();
right.data = value;
root.right = right;
}
else
{
Insert(root.right, value);
}
}
return root;
}
In C :
/* you only have to complete the function given below.
node is defined as
struct node {
int data;
struct node *left;
struct node *right;
};
*/
struct node* insert( struct node* root, int data ) {
struct node *prev_node = NULL;
struct node *temp_node = root;
while (temp_node) {
prev_node = temp_node;
if (data < temp_node->data) {
temp_node = temp_node->left;
}
else {
temp_node = temp_node->right;
}
}
struct node *new_node = malloc(sizeof(struct node));
new_node->data = data;
if (!prev_node) {
root = new_node;
}
else {
if (data < prev_node->data) {
prev_node->left = new_node;
}
else {
prev_node->right = new_node;
}
}
return root;
}
In python3 :
#Node is defined as
#self.left (the left child of the node)
#self.right (the right child of the node)
#self.info (the value of the node)
def insert(self, val):
if not self.root:
self.root = Node(val)
else:
node = self.root
while(True):
if (node.info>val):
if node.left:
node = node.left
else:
node.left = Node(val)
return
else:
if node.right:
node = node.right
else:
node.right = Node(val)
return
#Enter you code here.
```

## View More Similar Problems

## Costly Intervals

Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the

View Solution →## The Strange Function

One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting

View Solution →## Self-Driving Bus

Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever

View Solution →## Unique Colors

You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti

View Solution →## Fibonacci Numbers Tree

Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T

View Solution →## Pair Sums

Given an array, we define its value to be the value obtained by following these instructions: Write down all pairs of numbers from this array. Compute the product of each pair. Find the sum of all the products. For example, for a given array, for a given array [7,2 ,-1 ,2 ] Note that ( 7 , 2 ) is listed twice, one for each occurrence of 2. Given an array of integers, find the largest v

View Solution →