Reverse The Doubly Linked List

Objective: Reverse The Doubly Linked List.

Example:

Approach:

• Every Node in a doubly-linked list has the next and previous pointer.
• Do the linear traversal of the linked list and keep swapping the next and previous pointers.
• In the end, make the last pointer the head of the list.

Run This Code

Code:

Output:

->4->3->2->1
->1->2->3->4

Also Read:

- In a Binary Tree, Create Linked Lists of all the nodes at each depth. Hard
- Alternate Splitting of a given Linked List Medium
- Reverse a Linked List in groups of given size 'K' Medium
- Swap Nodes in pairs in a Linked List by changing links Medium
- Convert a Sorted Doubly Linked List to Balanced BST. Medium
- Circular Linked List Complete Implementation Beginner
- Reverse a Linked List - Part 2 Medium
- Add two numbers represented by a linked list, Numbers are Stored in REVERSE order Medium