In this program, we will create a doubly linked list and remove the duplicate, if present, by traversing through the list.
List after removing duplicates:
In above list, node2 is repeated thrice, and node 3 is repeated twice. Current will point to head, and index will point to node next to current. Start traversing the list till a duplicate is found that is when current's data is equal to index's data. In above example, the first duplicate will be found at position 4. Assign index to another node temp. Connect index's previous node with index's next node. Delete temp which was pointing to duplicate node. This process will continue till all duplicates are removed.
- 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. removeDuplicateNode() will remove duplicate nodes from the list.
- Define a new node current which will initially point to head.
- Node index will always point to node next to current.
- Loop through the list until current points to null.
- Check whether current?s data is equal to index's data that means index is duplicate of current.
- Node temp will point to index to store duplicate node.
- The previous node to the index will point to next node to index.
- Since, temp is pointing to index, which is a duplicate node, so set temp to null.
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.