> It's a circular singly linked list.
But there is still an external pointer which points to ONE of the nodes of the ring, and if you delete that node of the list without updating the external pointer you still lose.
But for any other node, you just chase round the list until you find the previous node, then it's easy to delete a node.