Multiple Choice
A linked list class uses a Node class to represent nodes.A private recursive method
Node add(int index,E element,Node list) takes a reference list (referring to the first in a chain of Node objects) ,adds a node containing the given element at the given index,and returns a reference to the first node of the resulting chain.Assume that index is nonnegative and is less than or equal to the size of list.Under these circumstances,the add method should handle its base case (index is 0) by
A) returning list
B) adding a node containing element to the front of list and returning a reference to the newly created node
C) adding a node containing element to the front of list and returning list
D) adding a node containing element to the end of list
Correct Answer:

Verified
Correct Answer:
Verified
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
Q13: In a typical circular doubly linked list,a
Q15: A linked list class uses a Node
Q16: In a linked list implementation using a
Q17: To remove a node X with index
Q18: A method int size( )in a linked
Q19: A circularly linked list makes it easy