Implement a Class containing a sorted-circular-linked list of integers. Implement the "Add" method which receives an integer n and any node of the list (it does not have head or tail since it is circular). The method should insert the number in the correct place to keep it sorted.
Check out your Company Bowl for anonymous work chats.