deletion are same as that given for singly linked lists 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 new_node -next start step set ptr start step repeat step while ptr -next !start step set ptr ptr -next [end of loopstep set ptr -next new_node step exit figure case the first node is deleted case the last node is deleted deleting the first node from circular linked list consider the circular linked list shown in fig when we want to delete node from the beginning of the listthen the following changes will be done in the linked list algorithm to insert new node at the end start take variable ptr and make it point to the start node of the list start ptr move ptr further so that it now points to the last node of the list ptr start the next part of ptr is made to point to the second node of the list and the memory of the first node is freed the second node becomes the first node of the list ptr start figure deleting the first node from circular linked list figure shows the algorithm to delete the first node from circular linked list in step of the algorithmwe check if the linked list exists or not if start nullthen it signifies that there are no nodes in the list and the control is transferred to the last statement of the algorithm howeverif there are nodes in the linked listthen we use pointer variable ptr which will be used to traverse the list to ultimately reach the last node in step we change the next pointer of the last node to point to the second node of step if start null the circular linked list in step the memory write underflow occupied by the first node is freed finallyin go to step step the second node now becomes the first [end of ifstep set ptr start node of the list and its address is stored in the step repeat step while ptr -next !start pointer variable start step set ptr ptr -next [end of loopstep set ptr -next start -next step free start step set start ptr -next step exit figure algorithm to delete the first node deleting the last node from circular linked list consider the circular linked list shown in fig suppose we want to delete the last node from the linked listthen the following changes will be done in the linked list