data structures using figure shows the algorithm to insert new node at the beginning of linked list in step we first check whether memory is available for the new node if the free memory has exhaustedthen an overflow message is printed otherwiseif free memory cell is availablethen we allocate space for the new node set its data part with the given val and the next part is initialized with the address of the first node of the listwhich is stored in start nowsince the new node is added as the first node of the listit will now be known as the start nodethat isthe start pointer variable will now hold figure algorithm to insert new node at the beginning the address of the new_node while inserting node in circular linked listwe have to use while loop to traverse to the last node of the list because the last node contains pointer to startits next field is updated so that after insertion it points to the new node which will be now known as start step if avail null write overflow go to step [end of ifstep set new_node avail step set avail avail -next step set new_node -data val step set ptr start step repeat step while ptr -next !start step ptr ptr -next [end of loopstep set new_node -next start step set ptr -next new_node step set start new_node step exit inserting node at the end of circular linked list consider the linked list shown in fig suppose we want to add new node with data as the last 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 which will initially point to start ptr startmove ptr so that it now points to the last node of the list start ptr add the new node after the node pointed by ptr start ptr figure inserting new node at the end of circular linked list figure shows the algorithm to insert new node at the end of circular linked list in step we take pointer variable ptr and initialize it with start that isptr now points to the first node of the linked list in the while loopwe traverse through the linked list to reach the last node once we reach the last nodein step we change the next pointer of the last node to store the address of the new node remember that the next field of the new node contains the address of the first node which is denoted by start deleting node from circular linked list in this sectionwe will discuss how node is deleted from an already existing circular linked list we will take two cases and then see how deletion is done in each case rest of the cases of