Multiple Choice
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
Correct Answer:

Verified
Correct Answer:
Verified
Q7: Deleting an entire list simply requires the
Q8: Nodes in a linked list are stored
Q9: This type of list does not contain
Q12: If there are no nodes in a
Q21: A linked list is a series of
Q34: The _ of a linked list points
Q35: ADT stands for<br>A) Algorithm Dependent Template<br>B) Algorithm
Q36: A linked list is called "linked" because
Q37: When you delete a node from a
Q39: Linked lists are less complex to code