{"id":26879,"date":"2017-12-26T20:28:27","date_gmt":"2017-12-26T14:58:27","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26879"},"modified":"2017-12-26T20:28:27","modified_gmt":"2017-12-26T14:58:27","slug":"python-algorithm-circular-linked-list-traversal","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/python-algorithm-circular-linked-list-traversal\/","title":{"rendered":"Python algorithm-Circular Linked List | Set 2 (Traversal)"},"content":{"rendered":"

We have discussed Circular Linked List Introduction and Applications,<\/a> in the previous post on Circular Linked List. In this post, traversal operation is discussed.<\/p>\n

\"Circular<\/p>\n

In a conventional linked list, we traverse the list from the head node and stop the traversal when we reach NULL. In a circular linked list, we stop traversal when we reach the first node again. Following is C code for linked list traversal.<\/p>\n

<\/div> 
\/* Function to traverse a given Circular linked list and print nodes *\/void printList(struct node *first){    struct node *temp = first;      \/\/ If linked list is not empty    if (first != NULL)     {        \/\/ Keep printing nodes till we reach the first node again        do        {            printf("%d ", temp->data);            temp = temp->next;        }        while (temp != first);    }}<\/code><\/pre> <\/div>\n
Python Programming:<\/p>\n
 
 <\/div> 
# Python program to demonstrate circular linked list traversal  # Structure for a Nodeclass Node:         # Constructor to create  a new node    def __init__(self, data):        self.data = data         self.next = None class CircularLinkedList:         # Constructor to create a empty circular linked list    def __init__(self):        self.head = None     # Function to insert a node at the beginning of a    # circular linked list    def push(self, data):        ptr1 = Node(data)        temp = self.head                 ptr1.next = self.head         # If linked list is not None then set the next of        # last node        if self.head is not None:            while(temp.next != self.head):                temp = temp.next            temp.next = ptr1         else:            ptr1.next = ptr1 # For the first node         self.head = ptr1      # Function to print nodes in a given circular linked list    def printList(self):        temp = self.head        if self.head is not None:            while(True):                print "%d" %(temp.data),                temp = temp.next                if (temp == self.head):                    break  # Driver program to test above function # Initialize list as emptycllist = CircularLinkedList() # Created linked list will be 11->2->56->12cllist.push(12)cllist.push(56)cllist.push(2)cllist.push(11) print "Contents of circular Linked List"cllist.printList()<\/code><\/pre> <\/div>\n[ad type=”banner”]\n
Output:<\/p>\n
Contents of Circular Linked List\r\n 11 2 56 12<\/pre>\n","protected":false},"excerpt":{"rendered":"
Circular Linked List (Traversal) – Circular Linked List In a conventional linked list, we traverse the list from the head node and stop the traversal.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[79477,79476],"tags":[80116,80119,80096,80118,80117,80115,79561,83749,83746,83745,83747,83748,83743,83742,83744],"class_list":["post-26879","post","type-post","status-publish","format-standard","hentry","category-circular-linked-list","category-linked-list","tag-algorithm-for-circular-linked-list-in-data-structure","tag-circular-doubly-linked-list-java-code","tag-circular-linked-list-algorithm-pdf","tag-circular-linked-list-applications-circular-linked-list-algorithm-ppt","tag-circular-linked-list-in-c","tag-circular-linked-list-insertion-and-deletion-program","tag-circular-linked-list-java","tag-linked-list-traversal-c","tag-searching-a-linked-list","tag-singly-linked-list-algorithm-data-structures","tag-traversal-linked-list-algorithm","tag-traverse-linked-list-means","tag-traversing-a-linked-list-algorithm","tag-traversing-a-linked-list-java","tag-traversing-a-linked-list-program-in-c"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26879","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26879"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26879\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26879"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26879"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26879"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}