diff --git a/DataStructures/Trees/Binary Search Tree : Insertion/solu.cpp b/DataStructures/Trees/Binary Search Tree : Insertion/solu.cpp
new file mode 100644
index 0000000..a0bad9d
--- /dev/null
+++ b/DataStructures/Trees/Binary Search Tree : Insertion/solu.cpp	
@@ -0,0 +1,53 @@
+
+
+/*
+Node is defined as 
+
+class Node {
+    public:
+        int data;
+        Node *left;
+        Node *right;
+        Node(int d) {
+            data = d;
+            left = NULL;
+            right = NULL;
+        }
+};
+
+*/
+
+    Node * insert(Node * root, int data) {
+        Node* temp=new Node(data);
+        Node* point=root;
+        
+
+        if(root==NULL)
+        return temp;
+        while(true)
+        {
+            if(point->data>data)
+            {if(point->left==NULL)
+            {
+                point->left=temp;
+                break;
+            }
+            else
+            point=point->left;
+            }
+            else if(point->data<data)
+            { if(point->right==NULL)
+            {
+                point->right=temp;
+                break;
+            }
+            else
+            point=point->right;
+            }
+        }
+       
+
+
+        return root;
+    }
+