diff --git a/CODE in C/Data Structures/a.out b/CODE in C/Data Structures/a.out
new file mode 100755
index 0000000..2bad9d6
Binary files /dev/null and b/CODE in C/Data Structures/a.out differ
diff --git a/CODE in C/Data Structures/reverse_linked_list.c b/CODE in C/Data Structures/reverse_linked_list.c
new file mode 100644
index 0000000..e87fd33
--- /dev/null
+++ b/CODE in C/Data Structures/reverse_linked_list.c	
@@ -0,0 +1,66 @@
+#include <stdio.h> 
+#include <stdlib.h> 
+
+struct Node { 
+    int data; 
+    struct Node* next; 
+}; 
+
+static void reverse(struct Node** head_ref) 
+{ 
+    struct Node* prev = NULL; 
+    struct Node* current = *head_ref; 
+    struct Node* next = NULL; 
+    
+    while (current != NULL) 
+    { 
+        next = current->next; 
+        current->next = prev; 
+        prev = current; 
+        current = next; 
+    } 
+    
+    *head_ref = prev; 
+} 
+
+void push(struct Node** head_ref, int new_data) 
+{ 
+    struct Node* new_node = (struct Node*)malloc(sizeof(struct Node)); 
+    new_node->data = new_data; 
+    new_node->next = (*head_ref); 
+    (*head_ref) = new_node; 
+} 
+
+void printList(struct Node* head) 
+{ 
+    struct Node* temp = head; 
+    while (temp != NULL) { 
+        printf("%d  ", temp->data); 
+        temp = temp->next; 
+    } 
+} 
+
+int main() 
+{ 
+    struct Node* head = NULL;
+    
+    int n;
+    scanf("%d", &n);
+    
+    int nums[n];
+    
+    for(int i = n; i > 0; i--)
+        scanf("%d", &nums[i]);
+    
+    for(int i = n; i > 0; i--)
+    {
+        push(&head, nums[i]); 
+    }
+  
+    printf("Given linked list\n"); 
+    printList(head); 
+    reverse(&head); 
+    printf("\nReversed Linked list \n"); 
+    printList(head); 
+    getchar(); 
+}