//reverse a linked list class Node { int data; Node next; } public class LinkedList { Node head; public void reverse() { if (head == null) return; Node newHead = head; Node previous = null; while (newHead.next != null) { Node next = newHead.next; newHead.next = previous; previous = newHead; newHead = next; } newHead.next = previous; head = newHead; } }