└── Binary search tree


/Binary search tree:
--------------------------------------------------------------------------------
 1 | public static Node insert(Node root,int data) {
 2 |         if(root==null)
 3 |         {
 4 |             root=new Node(data);
 5 |             return root;
 6 |         }
 7 |         if(data<root.data)
 8 |         {
 9 |             root.left=insert(root.left,data);
10 |         }
11 |         else if(data>root.data)
12 |         {
13 |             root.right=insert(root.right,data);
14 |         }
15 |         return root;
16 | 
17 |     	
18 |     }
19 | 


--------------------------------------------------------------------------------