Linked List Reversal Step-by-Step

ListNode prev = null; ListNode curr = head;
while (curr != null) {
    ListNode nextTemp = curr.next;
    curr.next = prev;
    prev = curr;
    curr = nextTemp;
}
return prev;
Step: 0 / 0