insert node at beginning of circular linked list in kotlin

Kotlin program for insert node at beginning of circular linked list. Here more information.

// Kotlin Program 
// Insert node at beginning of circular linked list

// Define class of linked list Node
class LinkNode
{
	var data: Int;
	var next: LinkNode ? ;
	constructor(data: Int, first: LinkNode ? )
	{
		this.data = data;
		this.next = first;
	}
}
class CircularLinkedList
{
	var head: LinkNode ? ;
	// Class constructors
	constructor()
	{
		this.head = null;
	}
	// Insert node at begining of circular linked list
	fun insert(value: Int): Unit
	{
		// Create a node
		val node: LinkNode = LinkNode(value, this.head);
		if (this.head == null)
		{
			// First node of linked list
			this.head = node;
			node.next = this.head;
		}
		else
		{
			var temp: LinkNode ? = this.head;
			// Find the last node
			while (temp?.next != this.head)
			{
				// Visit to next node
				temp = temp?.next;
			}
			// Add node
			temp?.next = node;
			// make new head node
			this.head = node;
		}
	}
	// Display node element of circular linked list
	fun display(): Unit
	{
		if (this.head == null)
		{
			println("Empty Linked List");
		}
		else
		{
			println("  Linked List Element : ");
			// Get first node
			var temp: LinkNode ? = this.head;
			// iterate linked list
			while (temp != null)
			{
				// Display node
				print("  " + temp.data);
				// Visit to next node
				temp = temp.next;
				if (temp == this.head)
				{
					// Stop iteration
					return;
				}
			}
		}
	}
}
fun main(args: Array < String > ): Unit
{
	val task: CircularLinkedList = 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