This post is completed by 1 user
|Add to List|
Reverse The Doubly Linked List
Objective: Reverse The Doubly Linked List.
- 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.