diff --git a/Practise/practise.c b/Practise/practise.c
index 637326d..f19cc31 100644
--- a/Practise/practise.c
+++ b/Practise/practise.c
@@ -3,7 +3,7 @@
 
 struct node 
 {
-    int data;
+    int user_data;
     struct node *left;
     struct node *right;
 }
@@ -18,7 +18,7 @@ Node * insert(Node *root)
         printf("Enter the data into the node\n");
         int val;
         scanf("%d",&val);
-        tmp->data=val;
+        tmp->user_data=val;
         tmp->left=NULL;
         tmp->right=NULL;
 
@@ -32,7 +32,7 @@ Node * insert(Node *root)
             while(current!=NULL)
             {
                 parent=current;
-                if(val<current->data)
+                if(val<current->user_data)
                     current=current->left;
                 else
                     current=current->right;
@@ -46,4 +46,4 @@ Node * insert(Node *root)
         }
 
     return root;
-    }
\ No newline at end of file
+    }
diff --git a/Sorting/insertionSort.c b/Sorting/insertionSort.c
index ff927f0..f46ca37 100644
--- a/Sorting/insertionSort.c
+++ b/Sorting/insertionSort.c
@@ -1,5 +1,6 @@
 #include<stdio.h>
 #include<stdlib.h>
+#include<limits.h>
 void insertion_sort(int arr[],int n)
 {
     for(int i=0;i<n;i++)
@@ -49,4 +50,4 @@ int main()
     
 
 return 0;
-}
\ No newline at end of file
+}