Though a circular linked list is different from a singly linked list inserting a node in it is similar to singly linked lists only. First of all, you create a node to store the value of the node to be inserted, then traverse through the list until you find the node, after which this new node has to be inserted and then point the pointer of the new node to the next to the current node and the current nodes next to the new node in this way you can simply insert a new node at any point of the circular linked list.