@@ -0,0 +1,492 @@
+//https://www.hackerrank.com/challenges/binary-search-tree-insertion%0A%0A/* You only have to complete the function given below.%0A    class Node %7B%0A        int data;%0A        Node left;%0A        Node right;%0A    %7D%0A*/%0A%0Astatic Node Insert(Node root,int value)%7B%0A    if(root == null)%7B%0A        root = new Node();%0A        root.data = value;%0A    %7D else if(root.data %3C value)%7B%0A        root.right = Insert(root.right, value);%0A    %7D else %7B%0A        root.left = Insert(root.left, value);%0A    %7D%0A    return root;%0A%7D%0A

Create binary-search-tree-insertion.java