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:

- Implement Stack Using Linked List Beginner
- Reverse a Linked List - Part 2 Medium
- Insert a node in the given sorted linked list. Beginner
- Doubly Linked List Complete Implementation Beginner
- Merge or Combine Two Sorted Linked Lists Medium
- Remove Duplicates from an Unsorted Linked list Beginner
- Merge a Linked list into another Linked List at Alternate Positions. Medium