106. Reverse a Doubly-Linked List (In-place Algorithm)

Objective: Given a doubly-linked list, write an in-place algorithm to reverse the 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.

Output:

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

Related Problems:

- Swap Every Kth Node in a LinkedList Medium
- Merge K sorted Linked List - Using Priority Queue Hard
- Delete a Node in the Middle of a Linked List Without Access to Head Node Beginner
- Convert a Sorted Doubly Linked List to Balanced BST Medium
- Reverse a Linked List in groups of given size 'K' Medium