@@ -0,0 +1,1468 @@
+# Python program to demonstrate circular linked list traversal %0A %0A# Structure for a Node%0Aclass Node:%0A     %0A    # Constructor to create  a new node%0A    def __init__(self, data):%0A        self.data = data %0A        self.next = None%0A %0Aclass CircularLinkedList:%0A     %0A    # Constructor to create a empty circular linked list%0A    def __init__(self):%0A        self.head = None%0A %0A    # Function to insert a node at the beginning of a%0A    # circular linked list%0A    def push(self, data):%0A        ptr1 = Node(data)%0A        temp = self.head%0A         %0A        ptr1.next = self.head%0A %0A        # If linked list is not None then set the next of%0A        # last node%0A        if self.head is not None:%0A            while(temp.next != self.head):%0A                temp = temp.next%0A            temp.next = ptr1%0A %0A        else:%0A            ptr1.next = ptr1 # For the first node%0A %0A        self.head = ptr1 %0A %0A    # Function to print nodes in a given circular linked list%0A    def printList(self):%0A        temp = self.head%0A        if self.head is not None:%0A            while(True):%0A                print %22%25d%22 %25(temp.data),%0A                temp = temp.next%0A                if (temp == self.head):%0A                    break%0A %0A %0A# Driver program to test above function%0A %0A# Initialize list as empty%0Acllist = CircularLinkedList()%0A %0A# Created linked list will be 11-%3E2-%3E56-%3E12%0Acllist.push(12)%0Acllist.push(56)%0Acllist.push(2)%0Acllist.push(11)%0A %0Aprint %22Contents of circular Linked List%22%0Acllist.printList()%0A

Create circular_linked_list.py