Technical Question, given a singly linked list, how to reverse direction
Sigiloso
public void reverse() { Node prev = null; Node current = head; Node next = current.next; while(current.next != null) { current.next = prev; prev = current; current = next; next = current.next; } current.next = prev; head = current; }