diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp
index 4daa09b69..2f02af0e3 100644
--- a/data_structures/reverse_a_linked_list.cpp
+++ b/data_structures/reverse_a_linked_list.cpp
@@ -16,7 +16,7 @@
  * happens. And then we move the prev and current pointers one step forward.
  * Then the head node is made to point to the last node (prev pointer) after
  * completion of an iteration.
- * Graphic Explanation:https://bit.ly/38JLVRd
+ * Graphic Explanation:https://bit.ly/3nbVrFe
  */
 #include <iostream>/// for I/O operations
 #include <memory> /// for dynamic memory
@@ -134,7 +134,7 @@ void list::display() {
         std::cout << node->val << "\t";
         node = node->next;
     }
-    std::cout << "\n";
+    std::cout << std::endl;
 }