Python program to insert a new node at the end of the Doubly Linked List.

python tutorials and learn python

Created with Sketch.

Python program to insert a new node at the end of the Doubly Linked List.

In this program, we will create a doubly linked list and insert every new node at the end of the list. If the list is empty, then head and tail will point to the newly added node. If the list is not empty then, insert the new node at the end of the list such that tail’s next will point to new node. Make new node as the new tail of the list, and its next will point to null.

Python program to insert a new node at the end of the Doubly Linked List

In the above example, node 4 was the tail of the list. Now, the new node will be inserted at the end of the list such that node 4’s next will point to the new node. Make new node as the tail of the list, and its next will point to null.

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. addAtEnd() 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. 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;
  7. class InsertEnd:
  8.     #Represent the head and tail of the doubly linked list  
  9.     def __init__(self):
  10.         self.head = None;
  11.         self.tail = None;
  12.     #addAtEnd() will add a node to the end of the list  
  13.     def addAtEnd(self, data):
  14.         #Create a new node  
  15.         newNode = Node(data);
  16.         #If list is empty  
  17.         if(self.head == None):
  18.             #Both head and tail will point to newNode  
  19.             self.head = self.tail = newNode;
  20.             #head’s previous will point to None  
  21.             self.head.previous = None;
  22.             #tail’s next will point to None, as it is the last node of the list  
  23.             self.tail.next = None;
  24.         #Add newNode as new tail of the list  
  25.         else:
  26.             #newNode will be added after tail such that tail’s next will point to newNode  
  27.             self.tail.next = newNode;
  28.             #newNode’s previous will point to tail  
  29.             newNode.previous = self.tail;
  30.             #newNode will become new tail  
  31.             self.tail = newNode;
  32.             #As it is last node, tail’s next will point to None  
  33.             self.tail.next = None;
  34.     #display() will print out the nodes of the list  
  35.     def display(self):
  36.         #Node current will point to head  
  37.         current = self.head;
  38.         if(self.head == None):
  39.             print(“List is empty”);
  40.             return;
  41.         print(“Adding a node to the end of the list: “);
  42.         while(current != None):
  43.             #Prints each node by incrementing pointer.  
  44.             print(current.data),
  45.             current = current.next;
  46.         print();
  47. dList = InsertEnd();
  48. #Adding 1 to the list  
  49. dList.addAtEnd(1);
  50. dList.display();
  51. #Adding 2 to the list  
  52. dList.addAtEnd(2);
  53. dList.display();
  54. #Adding 3 to the list  
  55. dList.addAtEnd(3);
  56. dList.display();
  57. #Adding 4 to the list  
  58. dList.addAtEnd(4);
  59. dList.display();
  60. #Adding 5 to the list  
  61. dList.addAtEnd(5);
  62. dList.display();

Output:

Adding a node to the end of the list: 
1 
Adding a node to the end of the list: 
1 2 
Adding a node to the end of the list: 
1 2 3 
Adding a node to the end of the list: 
1 2 3 4 
Adding a node to the end of the list: 
1 2 3 4 5

Leave a Reply

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