https://webrewrite.com/program-reverse-linked-list-using-recursion/ Technology Blog Where You Find Programming Tips and Tricks Sun, 30 Apr 2017 16:37:06 +0000 hourly 1 https://wordpress.org/?v=6.9.4 https://webrewrite.com/program-reverse-linked-list-using-recursion/#comment-784 Sun, 18 Sep 2016 07:31:00 +0000 http://webrewrite.com/?p=1578#comment-784 Algorithm to reverse a linked list using iteration
1. We will use three node pointer “previous”, “current” and “next” to keep track of previous, current and next node during linked list reversal.
2. Initialize current pointer to head and previous pointer to NULL.
3. Traverse linked list from head till current->next != NULL.
4. In every iteration, set current->next = previous; and move all three pointers to next node.
5. Return previous pointer. This is the new head pointer of reversed linked list.

]]>