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

Topics to Start - preparing for Data Structures and Algorithms

Learn in a different way :- Strings stacks and queues heaps searching hash table sorting recursion dynamic programming greedy algorithms graphs tree Binary Search Tree Linked List Array Parallel programming and concurrency design problems system design availability and scalability  Below topics are good to have object oriented programming language details ( java , python) object oriented design tools ( bash , git , maven , jira , jenkins , docker , kubernetes) database

Best LeetCode Lists for Interviews

Here is a list of some of the best questions asked in interviews:-  Must do 75 https://leetcode.com/list/5hkn6wze/ Must do 60  https://leetcode.com/list/5eie1aqd/ Must do medium:-  https://leetcode.com/list/5xaelz7g/ Must do Easy:-   https://leetcode.com/list/5r7rxpr1/ Graph:-  https://leetcode.com/list/x18ervrd/  Dynamic Programming:-    https://leetcode.com/list/x14z0dxr/  FaceBook interviews:- https://leetcode.com/list/xyu98pv6/  Amazon Interviews:-  https://leetcode.com/list/5hkniyf7/  Google Interviews:- https://leetcode.com/list/xyu9xfo1/ https://github.com/nazarmubeen/TopProblems/blob/master/README.md