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

Question

Quizplus · Accepted Answer

When adding a node at the front of the list (index=0), we need to create a new Node object containing the given element and make its next pointer point to the original list. Then, we return a reference to the new Node object, which is now the first node in the resulting chain. This is why choice B is the best option. Choice A would just return the original list and not add any new nodes. Choice C would also add a new node at the front of the list, but it would return a reference to the original list, not the newly created node. Choice D would add a node at the end of the list, not at the front, which is not what the question is asking for.

A Linked List Class Uses a Node Class to Represent