Binary search tree

Author: Octa

src/main/java/com/datastructures/tree/BinarySearchTree.java

@@ -42,12 +42,45 @@ public Node insertIteratively(Node root, int value) {
 
     }
 
-    /*public Tree insertRecursively(Tree root, int value) {
+    public static Node insertRecursively(Node root, int value) {
 
-    }*/
+        if(root == null) {
+            root = new Node(value);
+            return root;
+        }
+
+        if(root.value <= value) {
+            root.right = insertRecursively(root.right, value);
+        }
+        else {
+            root.left = insertRecursively(root.left, value);
+        }
+
+        return root;
+
+    }
+
+    public static void inorder(Node root)
+    {
+        if (root == null) {
+            return;
+        }
+
+        inorder(root.left);
+        System.out.print(root.value + " ");
+        inorder(root.right);
+    }
 
     public static void main(String[] args) {
 
+        int[] values = {15, 10, 20, 8, 12, 16, 25};
+
+        Node root = null;
+        for(int val: values) {
+            root = insertRecursively(root, val);
+        }
+
+        inorder(root);
     }