GATE CS 1987 Q1-xv — Linked Lists

To insert a new node (record) into a standard singly circular linked list after a given node $P$, we need to update two pointer references:

1. The pointer of the new node must be set to point to the node that currently follows $P$:
   new_node->next = P->next;
2. The pointer of node $P$ must be updated to point to the new node:
   P->next = new_node;

Thus, exactly two pointers are modified during the insertion operation.