Insert in Sorted Circular Linked List

insert_singly_circular_ll.rb

def insert(new_node)
  
  if tail == nil
    new_node.next = new_node
    tail = new_node
  else
    curr = tail.next
    
    while curr.next != tail && curr.data <= new_node.data
      curr = curr.next
    end
    
    new_node.next = curr.next
    curr.next = new_node
    
    if curr == tail && curr.data >= tail.data
      tail = new_node
    end
  end
end