backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-30 08:41:30 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 842c4ab5dd

Browse Source
This commit is contained in:
github-actions
2023-04-21 16:16:37 +00:00
parent 32e090479d
commit 64c9693255
46 changed files with 332 additions and 256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
d6/d05/reverse__a__linked__list_8cpp.html
View File

@@ -152,7 +152,7 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of <a href="https://simple.wikipedia.org/wiki/Linked_list" target="_blank">Reversing a single linked list</a> </p>
<p>The linked list is a data structure used for holding a sequence of values, which can be added, displayed, reversed, or removed. </p>
<h3><a class="anchor" id="autotoc_md43"></a>
<h3><a class="anchor" id="autotoc_md44"></a>
Algorithm</h3>
<p>Values can be added by iterating to the end of a list (by following the pointers) starting from the first link. Whichever link points to null is considered the last link and is pointed to the new value.</p>
<p>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 an iteration.</p>