Reverse a Doubly Linked List

Doubly linked list is combination of data and two pointer fields. this ev every node pointer fields are hold the reference of next and previous nodes. In this situation when we are reverse the doubly linked list the following scenario will occured.

Suppose we are inserted the following (1,7,8,3,2,9,13,5) node in a sequence.

Note that there are change the location of head pointer to last node of linked list. And modified the every node of linked list pointer field are in a following sequence. next pointer are store the reference of previous node, and similarly previous node are store the reference of next node.

We can solve this problem by iterates linked list nodes. Here given code implementation process.

1) Reverse doubly linked list in java 2) Reverse doubly linked list in c++ 3) Reverse doubly linked list in c 4) Reverse doubly linked list in golang 5) Reverse doubly linked list in c# 6) Reverse doubly linked list in vb.net 7) Reverse doubly linked list in php 8) Reverse doubly linked list in node js 9) Reverse doubly linked list in typescript 10) Reverse doubly linked list in python 11) Reverse doubly linked list in ruby 12) Reverse doubly linked list in scala 13) Reverse doubly linked list in swift 14) Reverse doubly linked list in kotlin