Data structure - How is Java flipped linked list implemented?
public class Node {
public int value;
public Node next;
public Node(int data) {
this.value = data;
}
public Node reverse(Node head) {
Node pre = null;
Node next = null;
while (head != null) {
next = head.next;
head.next = pre;
pre = head;
head = next;
}
return pre;
}
How does this code flip in the while loop? I want to be more detailed. I debugged it several times and still don’t understand what’s going on.
