Previously, to iterate through a linked list, we used a while loop. Which of the following for-loops could replace the previous while loop that would start at head and go until temp == null?
A) for (Node temp = header.front, int j = 0; j

Question

Previously, to iterate through a linked list, we used a while loop. Which of the following for-loops could replace the previous while loop that would start at head and go until temp == null?
A) for (Node temp = header.front, int j = 0; j < header.count; temp = temp.next) { ... }
B) for (int j = 0; j < header.count; j++) { ... }
C) for (Node temp = header.front; temp != header.rear; temp = temp.next) { ... }
D) for (Node temp = header.front, int j = 0; j < header.count; temp = temp.next, j++) { ...}
E) for (Node temp = header.front, int j = 0; j < header.count && temp != header.rear; temp = temp.next, j++) { ... }

Quizplus · Accepted Answer

D) Since header stores the number of elements in the linked list, we can start with a counter (j) at 0 and iterate while the counter is less than header.count, adding 1 after each iteration. We also need to make sure that we go from Node to Node. Only the loop in answer d accomplishes both of those steps. Note that answer c might seem right, but would stop once the loop has reached the last Node, not once the loop has finished with the last Node.

Previously, to Iterate Through a Linked List, We Used a While