From 19b4a937028631d140d50a32219504a04e795198 Mon Sep 17 00:00:00 2001 From: Tisha Soumya Date: Mon, 6 Sep 2021 23:59:51 +0530 Subject: [PATCH] Update the description in data_structures/reverse_a_linked_list.cpp Co-authored-by: David Leal --- data_structures/reverse_a_linked_list.cpp | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/data_structures/reverse_a_linked_list.cpp b/data_structures/reverse_a_linked_list.cpp index fb421cd44..5385a7ec0 100644 --- a/data_structures/reverse_a_linked_list.cpp +++ b/data_structures/reverse_a_linked_list.cpp @@ -9,13 +9,13 @@ * the pointers) starting from the first link. Whichever link points to null * is considered the last link and is pointed to the new value. * - * Linked List can be reversed by using 3 pointers ,current ,prev and next_node - * ; We keep iterating till the last node,meanwhile before changing to the next - * of current ,we store it in the next_node pointer; now we store the prev - * pointer in the current of next ,this is where the actual reversal happens, + * Linked List can be reversed by using 3 pointers: current, previous, and next_node; + * we keep iterating until the last node. Meanwhile, before changing to the next + * of current, we store it in the next_node pointer, now we store the prev + * pointer in the current of next, this is where the actual reversal 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 iteration . + * completion of an iteration. */ #include