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
Jesse and Cookies
Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t
View Solution →Find the Running Median
The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.
View Solution →Minimum Average Waiting Time
Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h
View Solution →Merging Communities
People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w
View Solution →Components in a graph
There are 2 * N nodes in an undirected graph, and a number of edges connecting some nodes. In each edge, the first value will be between 1 and N, inclusive. The second node will be between N + 1 and , 2 * N inclusive. Given a list of edges, determine the size of the smallest and largest connected components that have or more nodes. A node can have any number of connections. The highest node valu
View Solution →Kundu and Tree
Kundu is true tree lover. Tree is a connected graph having N vertices and N-1 edges. Today when he got a tree, he colored each edge with one of either red(r) or black(b) color. He is interested in knowing how many triplets(a,b,c) of vertices are there , such that, there is atleast one edge having red color on all the three paths i.e. from vertex a to b, vertex b to c and vertex c to a . Note that
View Solution →