diff --git a/data_structures/stack/stack_linkedlist/main.c b/data_structures/stack/stack_linkedlist/main.c
index 6c8d1477f..2e599e9a9 100644
--- a/data_structures/stack/stack_linkedlist/main.c
+++ b/data_structures/stack/stack_linkedlist/main.c
@@ -5,18 +5,18 @@
 
 int main() {
     Stack_T stk;
-	stk = Stack_init();
-	Stack_push(stk, (int *) 1);
-	Stack_push(stk, (int *) 2);
-	Stack_push(stk, (int *) 3);
-	Stack_push(stk, (int *) 4);
+    stk = Stack_init();
+    Stack_push(stk, (int *) 1);
+    Stack_push(stk, (int *) 2);
+    Stack_push(stk, (int *) 3);
+    Stack_push(stk, (int *) 4);
     printf("Size: %d\n", Stack_size(stk));
-	Stack_print(stk);
-	Stack_pop(stk);
-	printf("Stack after popping: \n");
-	Stack_print(stk);
-	Stack_pop(stk);
-	printf("Stack after popping: \n");
-	Stack_print(stk);
+    Stack_print(stk);
+    Stack_pop(stk);
+    printf("Stack after popping: \n");
+    Stack_print(stk);
+    Stack_pop(stk);
+    printf("Stack after popping: \n");
+    Stack_print(stk);
     return 0;
 }
diff --git a/data_structures/stack/stack_linkedlist/stack.c b/data_structures/stack/stack_linkedlist/stack.c
index 1e4750b3b..4668d6946 100644
--- a/data_structures/stack/stack_linkedlist/stack.c
+++ b/data_structures/stack/stack_linkedlist/stack.c
@@ -8,60 +8,60 @@
 
 typedef struct elem {
     void *val;
-	struct elem *next;
+    struct elem *next;
 } elem_t;
 
 struct T {
     int count;
-	elem_t *head;
+    elem_t *head;
 };
 
 /* Initial stack */
 T Stack_init (void) {
     T stack;
-	stack = (T) malloc(sizeof(T));
-	stack->count = 0;
-	stack->head = NULL;
-	return stack;
+    stack = (T) malloc(sizeof(T));
+    stack->count = 0;
+    stack->head = NULL;
+    return stack;
 }
 
 /* Check empty stack*/
 int Stack_empty(T stack) {
     assert(stack);
-	return stack->count == 0;
+    return stack->count == 0;
 }
 
 /* Return size of the stack */
 int Stack_size(T stack) {
     assert(stack);
-	return stack->count;
+    return stack->count;
 }
 
 /* Push an element into the stack */
 void Stack_push(T stack, void *val) {
     elem_t *t;
 
-	assert(stack);
-	t = (elem_t *) malloc(sizeof(elem_t));
-	t->val = val;
+    assert(stack);
+    t = (elem_t *) malloc(sizeof(elem_t));
+    t->val = val;
     t->next = stack->head;
-	stack->head = t;
-	stack->count++;
+    stack->head = t;
+    stack->count++;
 }
 
 /* Pop an element out of the stack */
 void *Stack_pop(T stack) {
     void *val;
-	elem_t *t;
+    elem_t *t;
 
-	assert(stack);
-	assert(stack->count > 0);
-	t = stack->head;
-	stack->head = t->next;
+    assert(stack);
+    assert(stack->count > 0);
+    t = stack->head;
+    stack->head = t->next;
     stack->count--;
-	val = t->val;
-	free(t);
-	return val;
+    val = t->val;
+    free(t);
+    return val;
 }
 
 /* Print all elements in the stack */
@@ -69,11 +69,11 @@ void Stack_print(Stack_T stack) {
     assert(stack);
 
     int i, size = Stack_size(stack);
-	elem_t *current_elem = stack->head;
-	printf("Stack [Top --- Bottom]: ");
-	for(i = 0; i < size; ++i) {
-	    printf("%p ", (int *)current_elem->val);
-		current_elem = current_elem->next;
-	}
-	printf("\n");
+    elem_t *current_elem = stack->head;
+    printf("Stack [Top --- Bottom]: ");
+    for(i = 0; i < size; ++i) {
+        printf("%p ", (int *)current_elem->val);
+        current_elem = current_elem->next;
+    }
+    printf("\n");
 }