From ac273aa4a3c1c42f3ce07c38a416c6bbbc6daeac Mon Sep 17 00:00:00 2001 From: Tishasoumya-02 Date: Tue, 7 Sep 2021 13:31:15 +0530 Subject: [PATCH] docs :added an external link for explanation of the algorithim --- data_structures/reverse_a_linked_list.cpp | 1 + 1 file changed, 1 insertion(+) diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp index 2f12df9b6..746695e84 100644 --- a/data_structures/reverse_a_linked_list.cpp +++ b/data_structures/reverse_a_linked_list.cpp @@ -16,6 +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 */ #include #include