Question

The minimum number of pointer modification required for insertion operation in a circular linked list.

Answer 1

Suppose
Where : $\begin{array}{cc}\text{q}& \cdot \end{array}$
insert : $\begin{array}{cc}\text{p}& \cdot \end{array}$
Then
(1) P $\to$ Next = q $\to$ next
(2) q $\to$ next = p
i.e., 2 pointer modification.
final