Python program to remove duplicate elements from a Doubly Linked List.

Created with Sketch.
Python Programs

Python program to remove duplicate elements from a Doubly Linked List.

In this program, we will create a doubly linked list and remove the duplicate, if present, by traversing through the list.

Python program to remove duplicate elements from a Doubly Linked List

List after removing duplicates:

Python program to remove duplicate elements from a Doubly Linked List

In the 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 the 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.

ALGORITHM:

  1. 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.
  2. 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.
  3. 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.
  • 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.

PROGRAM:

  1. #Represent a node of doubly linked list  
  2. class Node:
  3.     def __init__(self,data):
  4.         self.data = data;
  5.         self.previous = None;
  6.         self.next = None;
  8. class RemoveDuplicate:
  9.     #Represent the head and tail of the doubly linked list  
  10.     def __init__(self):
  11.         self.head = None;
  12.         self.tail = None;
  14.     #addNode() will add a node to the list  
  15.     def addNode(self, data):
  16.         #Create a new node  
  17.         newNode = Node(data);
  19.         #If list is empty  
  20.         if(self.head == None):
  21.             #Both head and tail will point to newNode  
  22.             self.head = self.tail = newNode;
  23.             #head’s previous will point to None  
  24.             self.head.previous = None;
  25.             #tail’s next will point to None, as it is the last node of the list  
  26.             self.tail.next = None;
  27.         else:
  28.             #newNode will be added after tail such that tail’s next will point to newNode  
  29.             self.tail.next = newNode;
  30.             #newNode’s previous will point to tail  
  31.             newNode.previous = self.tail;
  32.             #newNode will become new tail  
  33.             self.tail = newNode;
  34.             #As it is last node, tail’s next will point to None  
  35.             self.tail.next = None;
  37.     #removeDuplicateNode() will remove duplicate nodes from the list  
  38.     def removeDuplicateNode(self):
  40.         #Checks whether list is empty  
  41.         if(self.head == None):
  42.             return;
  43.         else:
  44.             #Initially, current will point to head node  
  45.             current = self.head;
  46.             while(current != None):
  47.                 #index will point to node next to current  
  48.                 index = current.next
  49.                 while(index != None):
  50.                     if(current.data == index.data):
  51.                         #Store the duplicate node in temp  
  52.                         temp = index;
  53.                         #index’s previous node will point to node next to index thus, removes the duplicate node  
  54.                         index.previous.next = index.next;
  55.                         if(index.next != None):
  56.                             index.next.previous = index.previous;
  57.                         #Delete duplicate node by making temp to None  
  58.                         temp = None;
  59.                     index = index.next;
  60.                 current = current.next;
  62.     #display() will print out the nodes of the list  
  63.     def display(self):
  64.         #Node current will point to head  
  65.         current = self.head;
  66.         if(self.head == None):
  67.             print(“List is empty”);
  68.             return;
  69.         while(current != None):
  70.             #Prints each node by incrementing pointer.  
  71.             print(current.data),
  72.             current = current.next;
  73.         print();
  75. dList = RemoveDuplicate();
  76. #Add nodes to the list  
  77. dList.addNode(1);
  78. dList.addNode(2);
  79. dList.addNode(3);
  80. dList.addNode(2);
  81. dList.addNode(2);
  82. dList.addNode(4);
  83. dList.addNode(5);
  84. dList.addNode(3);
  86. print(“Originals list: “);
  87. dList.display();
  89. #Removes duplicate nodes  
  90. dList.removeDuplicateNode();
  92. print(“List after removing duplicates: “);
  93. dList.display();

Output:

Originals list: 
1 2 3 2 2 4 5 3 
List after removing duplicates: 
1 2 3 4 5
0

Leave a Reply

Your email address will not be published. Required fields are marked *

©  2025 python tutorials.  python-tutorials.in