From 971e9593ec76f07052ea36de5d0c9afe03004207 Mon Sep 17 00:00:00 2001 From: Tishasoumya-02 Date: Tue, 7 Sep 2021 22:23:10 +0530 Subject: [PATCH] fix: chamges in the code --- data_structures/reverse_a_linked_list.cpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) 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 /// for I/O operations #include /// 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; }