Insertion in Circular Linked List in java

import java.lang.*;
public class Main {
    public static void main(String[] args) {
        Main Obj = new Main();
        Obj.insertBegin(11);
        Obj.insertBegin(22);
        Obj.insertEnd(33);
        Obj.insertEnd(44);
        Obj.insertAfter(3,77);
        Obj.print();
    }
    public class Node{
        int element;
        Node next;
        public Node(int element) {
            this.element = element;
        }
    }

    public Node head = null;
    public Node tail = null;
    int size=0;

    public void insertBegin(int element){
        Node newEle = new Node(element);
        if(head == null) {
            head = newEle;
            tail = newEle;
            newEle.next = head;
        }
        else {
             newEle.next=head;
             head=newEle;
             tail.next = head;
        }
        size++;
    }

    public void insertEnd(int element){
        Node newEle = new Node(element);
        if(head == null) {
            head = newEle;
            tail = newEle;
            newEle.next = head;
        }
        else {
            tail.next=newEle;
            newEle.next=head;
            tail=newEle;
        }
        size++;
    }

    public void insertAfter(int n,int data)
    {
        int size = calcSize(head);

        // Can only insert after 1st position
        // Can't insert if position to insert is greater than size of Linked List
        if(n < 1 || n > size)
        {
            System.out.println("Can't insert\n");

        }
        else
        {
            Node newNode = new Node(data);
            // required to traverse
            Node temp = head;

            // traverse to the nth node
            while(--n > 1)
                temp=temp.next;

            newNode.next= temp.next;
            temp.next = newNode;
        }
    }
    public int calcSize(Node node){
        int size = 0;
        while(node!=tail){
            node = node.next;
            size++;
        }
        return size+1;
    }



    public void print() {  //print function
        Node current = head;
        if(head == null) {
            System.out.println("List is empty");
        }
        else {
            System.out.println("Nodes of the circular linked list: ");
            do{
                System.out.print(" "+ current.element);
                current = current.next;
            }while(current != head);
            System.out.println();
        }
    }
}

Output

Insertion at Beginning : 
 22 11
Insertion at End :
 22 11 33 44
Insertion after 2nd position
 44 22 77 11 33

Run

import java.lang.*;
public class Main {
    public static void main(String[] args) {
        Main Obj = new Main();

        Obj.insertBegin(11);
        Obj.insertBegin(22);
        System.out.println("Insertion at Beginning : ");
        Obj.print();

        Obj.insertEnd(33);
        Obj.insertEnd(44);
        System.out.println("Insertion at End :" );
        Obj.print();

        Obj.insertAfterPosition(2,77);
        System.out.println("Insertion after 2nd position");
        Obj.print();
    }
    public class Node{
        int element;
        Node next;
        Node prev;
        public Node(int element) {
            this.element = element;
        }
    }

    public Node head = null;
    public Node tail = null;
    int size=0;

    public void insertBegin(int element){
        Node newEle = new Node(element);
        if(head == null) {
            head = newEle;
            tail = newEle;
            newEle.next = head;
            newEle.prev=head;
        }
        else {
            head.prev = newEle;
            newEle.prev=tail;
            newEle.next = head;
            tail.next = newEle;
            head=newEle;
        }
        size++;
    }

    public void insertEnd(int element){
        Node newEle=new Node(element);
        if(head == null) {
            head = newEle;
            tail = newEle;
            newEle.next = head;
            newEle.prev=head;
        }
        else{
            tail.next=newEle;
            newEle.next=head;
            newEle.prev=tail;
            head.prev=newEle;
            tail=newEle;
        }
    }

    public void insertAfterPosition(int n, int data) {
        int len = getLength();

        // if insertion position is 0 means entering at start
        if (n == 0) {
            insertBegin(data);
            return;
        }
        // means inserting after last item
        if (n == len) {
            insertEnd(data);
            return;
        }

        // else insertion will happen somewhere in the middle


        if (n < 1 || len < n) System.out.println("Invalid position"); else { Node freshNode = new Node(data); // can remove null assignments also (constructor takes care of these) // added just for explanation purpose freshNode.next = null; freshNode.prev = null; // nthNode used to traverse the Linked List Node nthNode = head; // traverse till the nth node while (--n > 0) {
            nthNode = nthNode.next;
        }

        Node nextNode = nthNode.next; // (n+1)th node

        // assigning (n+1)th node's previous to this new node
        nextNode.prev = freshNode;

        // new_node's next assigned to (n+1)th node
        freshNode.next = nextNode;
        // new_node's previous assigned to nth node
        freshNode.prev = nthNode;

        // assign nth node's next to new_node
        nthNode.next = freshNode;
    }
}

    public int getLength() {
        int size = 0;
        Node temp=head;
        // traverse to the last node each time incrementing the size
        while (temp != tail) {
            temp = temp.next;
            size++;
        }
        return size;
    }

    public void print() {  //print function
        Node current = head;
        if(head == null) {
            System.out.println("List is empty");
        }
        else {
            do{
                System.out.print(" "+ current.element);
                current = current.next;
            }while(current != head);
            System.out.println();
        }
    }
}

Output

Insertion at Beginning : 
 22 11
Insertion at End :
 22 11 33 44
Insertion after 2nd position
 22 11 77 33 44