Effectively insert node at beginning of circular linked list in java

Java program for Effectively insert node at beginning of circular linked list . Here problem description and other solutions.

// Java Program 
// Insert node at beginning of circular linked list
// Using head and tail nodes

// Define class of linked list Node
class LinkNode
{
    public int data;
    public LinkNode next;
    public LinkNode(int data, LinkNode first)
    {
      	// Set node value
        this.data = data;
        this.next = first;
    }
}
public class CircularLinkedList
{
    public LinkNode head;
    public LinkNode tail;
    CircularLinkedList()
    {
      	// Set head and tail values
        this.head = null;
        this.tail = null;
    }
    // Insert node at begining of circular linked list
    public void insert(int value)
    {
        // Create a node
        LinkNode node = new LinkNode(value,this.head);
        if (this.tail == null)
        {
            // First node of linked list
            this.tail = node;
        }
        // Make new head
        this.head = node;
        // Connecting the last node to the top of the next field
        this.tail.next = this.head;
       

    }
    // Display node element of circular linked list
    public void display()
    {
        if (this.head == null)
        {
            System.out.println("Empty Linked List");
        }
        else
        {
            System.out.print("Linked List Element :");
            LinkNode temp = this.head;
            // iterate linked list
            while (temp != null)
            {
                // Display node
                System.out.print("  " + temp.data);
              
                if (temp == this.tail)
                {
                    // Stop iteration
                    // Or break;
                    return;
                }
                // Visit to next node
                temp = temp.next;
            }
        }
    }
    public static void main(String[] args)
    {
        CircularLinkedList task = new CircularLinkedList();
        // Add following linked list nodes
        task.insert(8);
        task.insert(7);
        task.insert(6);
        task.insert(5);
        task.insert(4);
        task.insert(3);
        task.insert(2);
        task.insert(1);
        // Display node
        task.display();
    }
}

Output

Linked List Element :  1  2  3  4  5  6  7  8