Insert into a sorted circular linked list

You are given a node somewhere in a circular linked list sorted in ascending order. Insert a value so the list stays sorted and return a node of the list. Handle an empty list, a list whose values are all equal, and a value larger or smaller than everything in it.