start (biology start (computer science figure roll no next memory representation of two circular linked lists stored in the memory the last node of the list when we traverse the data and next in this mannerwe will finally see that the linked list in fig stores characters that when put together form the word hello nowlook at fig two different linked lists are simultaneously maintained in the memory there is no ambiguity in traversing through the list because each list maintains separate start pointer which gives the address of the first node of the respective linked list the remaining nodes are reached by looking at the value stored in next by looking at the figurewe can conclude that the roll numbers of the students who have opted for biology are and similarlythe roll numbers of the students who chose computer science are and inserting new node in circular linked list in this sectionwe will see how new node is added into an already existing linked list we will take two cases and then see how insertion is done in each case case the new node is inserted at the beginning of the circular linked list case the new node is inserted at the end of the circular linked list inserting node at the beginning of circular linked list consider the linked list shown in fig suppose we want to add new node with data as the first node of the list then the following changes will be done in the linked list start allocate memory for the new node and initialize its data part to take pointer variable ptr that points to the start node of the list start ptr move ptr so that it now points to the last node of the list start add the new node in between ptr and start ptr ptr start make start point to the new node start figure inserting new node at the beginning of circular linked list