diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp
index fe16a0ec9..b433b76dd 100644
--- a/data_structures/reverse_a_linked_list.cpp
+++ b/data_structures/reverse_a_linked_list.cpp
@@ -5,7 +5,7 @@
  * @details
  * The linked list is a data structure used for holding a sequence of
  * values, which can be added, displayed, reversed, or removed.
- 
+
  * ### Algorithm
  * Values can be added by iterating to the end of a list (by following
  * the pointers) starting from the first link. Whichever link points to null