Q:

Python program to rotate doubly linked list by N nodes

belongs to collection: Python Doubly Linked List Programs

robaa
Save to bookmark
|
2022-11-08
|
  161 
0

In this program, we need to create a doubly linked list and rotate it by n node. This can be achieved by maintaining a pointer that starts from the head node and traverses the list until current points to the nth node. Move the list from head to the nth node and place it after tail. Now nth node will be the tail of the list and node next to the nth node will be the new head. Here, n should always be greater than 0 but less than the size of the list.

Original List:

List after rotating it by 3 nodes:

In the above example, we need to rotate list by 3 nodes. First, we iterate through the list until current points to the 3rd node which is, in this case, are node 3. Move the list from node 1 to 3 and place it after tail. Now, node 4 will be new head and node 3 will be the new tail.

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 the 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. rotateList() will rotate the list by given n nodes.

  • First, check whether n is 0 or greater than or equal to many nodes present in the list.
  • If yes, print the list as it is.
  • If no, define a node current which will point to head.
  • Iterate through the list until current reaches the nth node.
  • Tail's next will point to head node.
  • Make node next to current as the new head. Head's previous will point to null.
  • The current node will become tail of the list. Tail's next 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.
Python programming, examples, Python programming examples,
login and add your own answer to this question

All Answers

robaa
2022-11-08
need an explanation for this answer? contact us directly to get an explanation for this answer

PROGRAM:

#Represent a node of doubly linked list    
class Node:    
    def __init__(self,data):    
        self.data = data;    
        self.previous = None;    
        self.next = None;    
            
class RotateList:    
    #Represent the head and tail of the doubly linked list    
    def __init__(self):    
        self.head = None;    
        self.tail = None;    
        self.size = 0;    
            
    #addNode() will add a node to the list    
    def addNode(self, data):    
        #Create a new node    
        newNode = Node(data);    
            
        #If list is empty    
        if(self.head == None):    
            #Both head and tail will point to newNode    
            self.head = self.tail = newNode;    
            #head's previous will point to None    
            self.head.previous = None;    
            #tail's next will point to None, as it is the last node of the list    
            self.tail.next = None;    
        else:    
            #newNode will be added after tail such that tail's next will point to newNode    
            self.tail.next = newNode;    
            #newNode's previous will point to tail    
            newNode.previous = self.tail;    
            #newNode will become new tail    
            self.tail = newNode;    
            #As it is last node, tail's next will point to None    
            self.tail.next = None;    
        #Size will count the number of nodes present in the list    
        self.size = self.size + 1;    
            
    #rotateList() will rotate the list by given n nodes    
    def rotateList(self, n):    
        #Initially, current will point to head    
        current = self.head;    
            
        #n should not be 0 or greater than or equal to number of nodes present in the list    
        if(n == 0 or n >= self.size):    
            return;    
        else:    
            #Traverse through the list till current point to nth node    
            #after this loop, current will point to nth node    
            for i in range(1, n):    
                current = current.next;    
                    
            #Now to move entire list from head to nth node and add it after tail    
            self.tail.next = self.head;    
            #Node next to nth node will be new head    
            self.head = current.next;    
            #Previous node to head should be None    
            self.head.previous = None;    
            #nth node will become new tail of the list    
            self.tail = current;    
            #tail's next will point to None    
            self.tail.next = None;    
                
    #display() will print out the nodes of the list    
    def display(self):    
        #Node current will point to head    
        current = self.head;    
        if(self.head == None):    
            print("List is empty");    
            return;    
                
        while(current != None):    
            #Prints each node by incrementing pointer.    
            print(current.data),    
            current = current.next;    
        print();    
            
dList = RotateList();    
#Add nodes to the list    
dList.addNode(1);    
dList.addNode(2);    
dList.addNode(3);    
dList.addNode(4);    
dList.addNode(5);    
     
print("Original List: ");    
dList.display();    
     
#Rotates list by 3 nodes    
dList.rotateList(3);    
     
print("Updated List: ");    
dList.display();

 

Output:

Original List: 
1 2 3 4 5 
Updated List: 
4 5 1 2 3

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

Python Doubly Linked List Programs
This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now
Python program to search an element in a doubly li... >>
<< Python program to remove duplicate elements from a...