In many recursive operations on linked lists,
A) the head of the list is chopped off and thrown away.
B) the base case considers the last element of the list.
C) the base case is when the list is empty or has a single element.
D) All of the above
E) None of the above

Question

Quizplus · Accepted Answer

In many recursive operations on linked lists, the base case is when the list is empty or has a single element. This is because the recursive operation usually processes the head of the list and then makes a recursive call on the rest of the list. Eventually, the recursive call will reach the base case when the list is empty or has a single element, and the recursion will stop. The other options (A and B) may be true for some specific recursive operations on linked lists, but they are not true in general.

In Many Recursive Operations on Linked Lists