Reverse a linked list by changing links between nodes

import java.util.*;

 class Main
{

  public static void main (String[]args) throws Exception
  {
    LinkedList ll = new LinkedList ();
      ll.addFirst (24);
      ll.addFirst (16);
      ll.addFirst (12);
      ll.addFirst (8);
	  
      System.out.println("Linked List before reversal");
	  ll.display ();
   
      ll.reversePI ();
	  
	  System.out.println("Linked List after reversal");
      ll.display ();

  }

}

class LinkedList
{
  private class Node
  {
    int data;
    Node next;

// Node constructor
// There are two fields in the node- data and address of next node
    public Node (int data, Node next)
    {
      this.data = data;
      this.next = next;
    }
  }

  private Node head;
  private Node tail;
  private int size;

// Linked list constructor
  public LinkedList ()
  {
    this.head = null;
    this.tail = null;
    this.size = 0;

  }

// Function to find the size of linked list
  public int size ()
  {
    return this.size;
  }

// Function to check whether linked list is empty or not
  public boolean isEmpty ()
  {
    return this.size () == 0;
  }

// Function to traverse and print the linked list
  public void display ()
  {
    Node temp = head;
    while (temp != null)
      {
	System.out.print (temp.data + " ");
// Set temp to point to the next node
	temp = temp.next;
      }
	  System.out.println(" ");
  }

// Function to add a node in beginning of linked list
  public void addFirst (int item)
  {
// Create a temp node which points to head
    Node temp = new Node (item, head);

// If linked list is empty, temp is the head and tail node both
    if (this.size == 0)
      {
	this.head = this.tail = temp;
      }

// else set the head such that it now points to temp node
    else
      {
	this.head = temp;

      }

    this.size++;
  }

// Auxiliary function to get node at any index
  private Node getNodeAt (int index) throws Exception
  {
    if (index < 0 || index >= this.size)
      {
	throw new Exception ("Index out of bound");
      }
    int i = 0;
    Node temp = head;
    while (i < index)
      {
	temp = temp.next;
	i++;
      }
    return temp;

  }

//Function to reverse the linked list
  public void reversePI ()
  {
    Node nm1 = null;
    Node n = this.head;
    Node np1 = n;

    while (n.next != null)
      {
	np1 = np1.next;

	n.next = nm1;
	nm1 = n;
	n = np1;

      }

// Change next of last node
    n.next = nm1;

// Swap head and tail
    Node temp = this.head;
    this.head = this.tail;
    this.tail = temp;
  }

}

Output
Linked list before reversal
8  12  16  24
Linked list after reversal
24  16 12  8