Python Data Structures and Algorithms

Appending elements

When we append an element to the circular list, we need to make sure that the new node points back to the tail node. This is demonstrated in the following code. There is one extra line as compared to the singly linked list implementation:

     def append(self, data):            node = Node(data)            if self.head:                self.head.next = node                self.head = node            else:                self.head = node                self.tail = node            self.head.next = self.tail            self.size += 1