An insertion or deletion routine requires that you create this many pointers for use during the traversal process.
A) two -- one for the node being inspected, and one for the previous node.
B) two -- one for the node being inspected, and one for the next node.
C) one -- for the node being inserted or deleted
D) three -- one for the inspected node, one for the next node, and one for the following node

Question

Quizplus · Accepted Answer

In an insertion or deletion routine in a linked list, you typically need two pointers: one for the current node being inspected and one for the previous node to adjust the links properly.

An Insertion or Deletion Routine Requires That You Create This