Reverse of Linked List

package ornek01;

public class ReverseLinkedList {
 
 static Node head;
 
 static class Node{
  int data;
  Node next;
  
  Node(int d){
   data = d;
   next = null;
  }
 }
 
 static Node reverse(Node node) {
  
  Node prev = null;
  Node curr = node;
  Node next = null;
  while(curr != null) {
   next = curr.next;
   curr.next = prev;
   prev= curr;
   curr = next;
  }
  return prev;  
  
 }
 
 static void print(Node node) {
  while(node != null) {
   System.out.print(node.data + " ");
   node = node.next;
  }
 }
 public static void main(String[] args) {
  ReverseLinkedList rl = new ReverseLinkedList();
  rl.head = new Node(2);
  rl.head.next = new Node(4);
  rl.head.next.next = new Node(3);
  
  rl.print(head);
  System.out.println("\nReverse:");
  head = rl.reverse(head);
  rl.print(head);
 
 }

}