Sorted insert for circular linked list
Dec 27, 2020
def insert(self,new_data):
temp = self.head
new_node = Node(new_data)
if temp == None:
self.head = new_node
new_node.next = self.head
return
while(temp):
if temp.next == self.head:
temp.next = new_node
new_node.next = self.head
return
if temp.data < new_data:
prev = temp
temp = temp.next
if temp.data>new_data:
prev.next = new_node
new_node.next = temp
return