Assuming a linked list of n nodes,the code fragment: Node curr = head;
While (curr != null){
System.out.println(curr.getItem());
Curr.setNext(curr.getNext());
} // end while
Requires ______ write operations.
A)n
B)n - 1
C)n + 1
D)1

Question

Quizplus · Accepted Answer

The code performs a write operation on each node by setting the next pointer, so it requires n write operations for n nodes.

Assuming a Linked List of N Nodes,the Code Fragment: Node