After performing an iterative reversal, what should you assign to head?

• A. head = curr
• B. head = null
• C. head = prev
• D. head = next

Answer: (C)

When reversing a singly linked list iteratively, you keep track of the new front of the list as you go. You typically use prev to store the last node you’ve processed, curr for the node you’re currently reversing, and next to hold the upcoming node. After you finish iterating, the node that becomes the new head is the one stored in prev, because prev points to the last non-null node you processed—which is now the first node of the reversed list. So you should assign head to prev.

Assigning head to curr would set head to null once the loop ends, since curr becomes null at termination. Assigning head to next would point to the next node in the original order, which no longer represents the new front after reversal. Assigning head to null would detach the list entirely. The correct update is head = prev because prev is the new head after reversal.