Skip to main content

Insertion in a Binary Search Tree JAVA

Insertion in a Binary Search Tree :_

Insertion in a BST follow simple operations. All the elements less than root lies on left subtree and all the elements greater than root lies on right subtree.

Every BST class will have a root variable of Node type that represents the head node of the tree.


public class BinarySearchTree {

 Node root;
 
 public BinarySearchTree()
 {
  root=null;
 }
 
 public Node insert(Node node,Node root)
 {
  if(root==null)
  {
   root=node;
   return root;
  }
  else{
  
  if(node.data>root.data)
  {
   
   root.right=insert(node,root.right);
  
  }
  else if(node.data<root.data)
  {
   root.left=insert(node,root.left);
  }
  
  }
  return root;
 }
}

Comments

.

Popular posts from this blog

Tree Traversal in JAVA (InOder/preOrder/postOrder)

Tree Traversal in JAVA (InOder/preOrder/postOrder):-

Tree traversal can be done through three ways.

1)Inorder:-

Go recursively to the left node.
Read a node
Go recursively to the right node.

2)Pre Order.

Read a node
Go recursively to the left node.
Go recursively to the right node.


2)Post Order.


Go recursively to the left node.
Go recursively to the right node.
Read a node



publicvoidinorder(Node root){if(root==null){return;} inorder(root.left); System.out.print(root.data+","); inorder(root.right);}publicvoidpreOrder(Node root){if(root==null){return;} System.out.print(root.data+","); preOrder(root.left); preOrder(root.right);}publicvoidpostOrder(Node root){if(root==null){return;} postOrder(root.left); postOrder(root.right); System.out.print(root.data+",");}