OA. free
Free
Sigmoid Data Structures & Algorithms Data Structures & Algorithms Medium

Question 9 Insertion of a node in a circular linked list requires modification of at the...

Sigmoid technical mcq question, verified with a worked answer. Free to practise - no sign-up.

Insertion of a node in a circular linked list requires modification of at the least:

Select an option

Choose one option.
Show answer & explanation
Answer: B. B) 2 pointers

Inserting a node into a circular linked list requires updating the predecessor node's next pointer and the new node's next pointer (at least 2 pointers).

Step-by-step Derivation:
Step 1: New node's next pointer must point to successor.
Step 2: Predecessor node's next pointer must point to new node.
Step 3: Minimum 2 pointer updates.