Reverse a Linked List - Iterative

Problem:
Given a linked list having n nodes. Reverse the list by nodes.

Solution:
Keep 3 pointers – prev (previous node), curr (current node) and nxt (next node).
1: Initialize prev = null, curr = null, nxt = head.
2: Set curr = nxt.
3: Move nxt to next node pointer.
4: Set curr’s next to prev.
5: Set prev to curr
6: Repeat steps 2-5 till next is not null.
7: Set curr as head pointer of the list

Code: http://www.ideserve.co.in/learn/reverse-a-linked-list-iterative

Website: http://www.ideserve.co.in

Facebook: https://www.facebook.com/IDeserve.co.in

Видео Reverse a Linked List - Iterative канала IDeserve