OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update the description in data_structures/reverse_a_linked_list.cpp

Browse Source 
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Tisha Soumya 2021-09-06 23:59:51 +05:30 committed by GitHub
parent 650a2fdc46
commit 19b4a93702
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
data_structures/reverse_a_linked_list.cpp
View File

@ -9,13 +9,13 @@
* the pointers) starting from the first link. Whichever link points to null * the pointers) starting from the first link. Whichever link points to null
* is considered the last link and is pointed to the new value. * 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 * Linked List can be reversed by using 3 pointers: current, previous, and next_node;
* ; We keep iterating till the last node,meanwhile before changing to the next * 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 * 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, * 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. * 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 * Then the head node is made to point to the last node (prev pointer) after
* completion of iteration . * completion of an iteration.
*/ */
#include <iostream> #include <iostream>