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

Breadth First Search Implementation in Java

Breadth First Search Implementation in Java For Graph Class Design and DFS implementation please refer to below link:- depth-first-search-implementation-in-java /* 1. Pick a vertex. 2. Get Adjacent Vertex. 3. Insert in queue ( at tail) 4. Remove vertex from queue( head) 5. Do until no vertex left in a queue. */ void searchBFS () { //this is how we define queue using LinkedList Queue < Character > queue = new LinkedList < Character >(); queue . add ( vertexlist [ 0 ]. label ); while (! queue . isEmpty ()) { //element at head (Function in main graph class please use above link) ArrayList adjvertex = getNeighbours ( queue . peek ()); System . out . println ( queue . peek ()); //element removed at head queue . remove (); if ( adjvertex != null ) { for ( int i = 0 ; i < adjvertex . size (); i ++) { //element added at tail queue . add