reverse of a linked list in java code example
Example 1: reverse a linked list
class recursion {
static Node head;
static class Node {
int data;
Node next;
Node(int d)
{ data = d;
next = null; } }
static Node reverse(Node head)
{
if (head == null || head.next == null)
return head;
Node rest = reverse(head.next);
head.next.next = head;
head.next = null;
return rest;
}
static void print()
{
Node temp = head;
while (temp != null) {
System.out.print(temp.data + " ");
temp = temp.next;
}
System.out.println();
}
static void push(int data)
{
Node temp = new Node(data);
temp.next = head;
head = temp;
}
public static void main(String args[])
{
push(20);
push(4);
push(15);
push(85);
System.out.println("Given linked list");
print();
head = reverse(head);
System.out.println("Reversed Linked list");
print();
} }
Example 2: revese the linked list java
Easiest way
public static LinkedList reverse(LinkedList head) {
LinkedList prevAddress = null;
LinkedList currentAddress = head;
LinkedList nextAddress = head.next;
while(nextAddress!=null) {
currentAddress.next = prevAddress;
prevAddress = currentAddress;
currentAddress = nextAddress;
nextAddress= currentAddress.next;
currentAddress.next = prevAddress;
}
head = currentAddress;
return head;
}
Just try to visualize its all about pointers game. :-)
NO GFG ANSWER