rotate ll java

// program to rotate the linked list anti-clockwise
import java.util.Scanner;

/**
 * Created by MOHIT on 24-01-2018.
 */

class node{

    public int element;
    public node link;

    //constructor that accepts only element
    node(int element) {
        this.element = element;
        this.link = null;
    }

    //constructor that accepts both link and element
    node(int element, node link){
        this.element = element;
        this.link = link;
    }

    //method to update the element
    void updateData(int element){
        this.element = element;
    }

    //method to update or setup link
    void updateLink(node link){
        this.link = link;
    }

    //method to get the element from the node
    int getElement(){
        return this.element;
    }

    //method to get the next node
    node getNextNode(){
        return this.link;
    }
}

class LL {

    Scanner sc = new Scanner(System.in);
    node head;

    void insertAtStart(int number){

        node newNode = new node(number);

        if(head == null){
            head = newNode;
        } else {
            newNode.updateLink(head);
        }
        head = newNode;

        return;
    }

    void insertAtEnd(int element){
        if(head == null){
            this.insertAtStart(element);
            return;
        }
        node current = this.head;
        while(current.getNextNode() != null){
            current = current.getNextNode();
        }

        node newNode = new node(element);
        current.updateLink(newNode);
        return;
    }

    void display(){
        node current = this.head;

        while(current!= null){
            System.out.print(current.getElement());
            if(current.getNextNode() != null){
                System.out.print("-->");
            }
            current = current.getNextNode();
        }
    }

    // rotate a linked list
    // function removes nodes from the beginning and puts them to the end of the linked list;
    void rotate(int shiftValue){
        node current = this.head;
        node tail = this.head;

        // make tail point the last element
        while(tail.getNextNode() != null){
            tail = tail.getNextNode();
        }

        for(int i = 0; i < shiftValue; i++){
            tail.updateLink(current);
            current = current.getNextNode();
            tail = tail.getNextNode();
            tail.updateLink(null);
        }

        // let head point to the new head node
        this.head = current;
    }
}
public class LinkedList {
    public static void main(String arg[]) {
        System.out.println("Program to rotate Linked List.");

        LL l1 = new LL();
        l1.insertAtEnd(1);
        l1.insertAtEnd(2);
        l1.insertAtEnd(3);
        l1.insertAtEnd(4);
        l1.insertAtEnd(5);
        l1.insertAtEnd(6);
        l1.insertAtEnd(7);
        l1.insertAtEnd(8);
        l1.display();
        System.out.println("\nRotating linked list by 4 places");
        l1.rotate(4);
        l1.display();
    }
}

/*

Program to rotate Linked List.

1-->2-->3-->4-->5-->6-->7-->8
Rotating linked list by 4 places
5-->6-->7-->8-->1-->2-->3-->4

 */