To remove a node with a positive index k from a linked list,
A) decrement k by 1,and set the reference to the node to be removed to null
B) start a reference r at the head of the list,walk r forward k steps,and then set r to null
C) assign the successor reference in the node with index k to the successor reference in the node with index k-1
D) decrement k by 1,and then use recursion

Question

Quizplus · Accepted Answer

Option C is the correct choice for removing a node with a positive index k from a linked list. To remove a node at index k, we need to reassign the reference of the node at index k-1 to point to the node at index k+1. This effectively removes the node at index k from the linked list. Option A and D do not properly remove the node from the linked list, and option B is inefficient as it requires us to traverse k steps starting from the head node to remove the node.

To Remove a Node with a Positive Index K from a Linked