Java program to create a doubly linked list of n nodes and display it in reverse order
In this program, we create a doubly linked list, and then reverse the list by reversing the direction of the list and print out the nodes.
Traverse through the list by swapping the previous pointer with next pointer of each node. Then, swap the position of head and tail node that is, head of the original list will become tail of new list and tail of the original list will become head of the new list. So, the reversed list will be:
- Define a Node class which represents a node in the list. It will have three properties: data, previous which will point to the previous node and next which will point to the next node.
- Define another class for creating a doubly linked list, and it has two nodes: head and tail. Initially, head and tail will point to null.
- addNode() will add node to the list:
- It first checks whether the head is null, then it will insert the node as the head.
- Both head and tail will point to a newly added node.
- Head's previous pointer will point to null and tail's next pointer will point to null.
- If the head is not null, the new node will be inserted at the end of the list such that new node's previous pointer will point to tail.
- The new node will become the new tail. Tail's next pointer will point to null.
a. reverse() will reverse the given doubly linked list.
- Define a node current which will initially point to head.
- Traverse through the list by making current to point to current.next in each iteration till current points to null.
- In each iteration, swap previous and next pointer of each node to reverse the direction of the list.
- In the end, swap the position of head and tail.
a. display() will show all the nodes present in the list.
- Define a new node 'current' that will point to the head.
- Print current.data till current points to null.
- Current will point to the next node in the list in each iteration.
1 2 3 4 5
5 4 3 2 1