Hello! So I’m doing a 30 day coding challenge where I solve a few questions every day and thought of posting them here on my blog so that you guys can join the challenge too!
Welcome to Coding challenge Day 15: Problem 2! Be sure to post your answers, queries etc in the comments!
Problem: Insert an element in a Binary Search Tree
Sample: Insert Element= 2
Tree before:

Tree after:

Solution:
Check this LINK for the logic
package tree.binarysearchtree;
public class Program002insert_in_bst {
static class Node{
int data;
Node left, right;
public Node (int d){
data=d;
left=right=null;
}
}
static class BST {
Node root=null;
public BST(){
root=null;
}
public void add_left (Node parent_node, Node node){
parent_node.left= node;
}
public void add_right(Node parent_node, Node node){
parent_node.right= node;
}
public Node insert(Node node, int element){
if(node.left==null && element<node.data){
Node new_node= new Node(element);
add_left(node, new_node);
return null;
}
if(node.right==null && element>node.data){
Node new_node= new Node(element);
add_right(node, new_node);
return null;
}
if(element<node.data){
return insert(node.left, element);
}
return insert(node.right, element);
}
public void inorder_traversal(Node node){
if(node==null){
return;
}
inorder_traversal(node.left);
System.out.print (node.data + " ");
inorder_traversal(node.right);
}
}
public static void main (String [] args){
BST tree= new BST();
tree.root= new Node(8);
Node node6= new Node(6);
tree.add_left(tree.root, node6);
Node node10= new Node(10);
tree.add_right(tree.root, node10);
Node node4= new Node(4);
tree.add_left(node6, node4);
Node node7= new Node(7);
tree.add_right(node6, node7);
Node node9= new Node(9);
tree.add_left(node10, node9);
Node node11= new Node(11);
tree.add_right(node10, node11);
Node node3= new Node(3);
tree.add_left(node4, node3);
Node node5= new Node(5);
tree.add_right(node4, node5);
tree.insert(tree.root, 2);
tree.inorder_traversal(tree.root);
}
}
Happy Learning!!