A linked list class uses a Node class with successor reference next and field element to store values.A recursive method to print all list elements can be written as
A) static void printList(Node list)
{
If (list != null)
{
System.out.println(list.element);
PrintList(list.next);
}
}
B) static void printList(Node list.
{
While (list!= null.
{
System.out.println(list.element.
PrintList(list.next.;
List = list.next;
}
}
C) static void printList(Node list.
{
While (list.next != null.
{
PrintList(list.next.;
System.out.println(list.element.
List ++;
}
}
D) static void printList(Node list.
{
System.out.println(list.element.:
PrintList(list.next.;
}

Question

Quizplus · Accepted Answer

Option A uses recursion to print all the list elements. It first checks if the current node is null, and if not, it prints the element and then calls the same function for the next node. This process continues until the end of the list is reached, making it an efficient and elegant solution.

Option B is not recursive and uses a while loop to traverse the list. Although it achieves the same result, it is less efficient than recursion since it uses more memory.

Option C is also a loop-based solution, but it uses an ineffective approach. It attempts to traverse the list by incrementing the "list" variable, which is a reference to the current node, causing infinite loop errors.

Option D is recursive and prints the current node's element before calling the function for the next node. However, it has a syntactical error by including a colon instead of a semicolon.

A Linked List Class Uses a Node Class with Successor