Circular Linked List Insertion in the middle in Java

public void insertMiddle(int data) {
        Node newNode = new Node(data);

        // if the LL was empty
        if(head == null){
            // use insert function to insert
            insert(data);
            return;
        }

        // otherwise
        Node temp = head;

        // find correct insertion position for middle
        int mid = (size % 2 == 0) ? (size/2) : (size+1)/2;

        // Unique case when there is only one node in CLL
        // we will be inserting at the last,
        // inserting 2nd node at the last
        // Example size = 1 will result in mid = 1 so entering after 1st node
        // where size itself is 1 so entering last node
        if(mid == size){
            newNode.next = head;
            head.next = newNode;
            return;
        }
        // traverse to current mid position
        while(--mid > 0){
            temp = temp.next;
        }

        newNode.next = temp.next;
        temp.next = newNode;
        size++;
    }