Multiple Choice
Scientists in a certain laboratory are working with a linked list class that uses recursion to compute its size.The scientists know that an empty list has size 0,so they never ask a linked list to compute its size when the list is empty.Under these circumstances,
A) the recursive method can become more efficient by eliminating the test for a base case
B) the recursive method should still handle the base case of an empty list,because it will still occur even though the scientists never ask for the size of an empty list
C) the recursive method can be modified to use a list of size 1 as the base case
D) B and C are both correct
Correct Answer:

Verified
Correct Answer:
Verified
Q2: To allocate storage for their elements,linked lists
Q3: The tail of a list<br>A) is an
Q4: To remove the first node in a
Q5: A list can be considered a recursive
Q6: To remove a node with index 0
Q8: In many recursive operations on lists,<br>A) the
Q9: A list method E remove(int index)designed to
Q10: A list in which each stored element
Q11: A linked list class uses a Node
Q12: In Java,the first node in a list