Sorted order insertion of linked list in java

Java program for Sorted order insertion of linked list. Here problem description and explanation.

/*
    Java program for
    Add node in sorted order of linked list
*/
// Linked list node
class LinkNode
{
	public int data;
	public LinkNode next;
	public LinkNode(int data)
	{
		this.data = data;
		this.next = null;
	}
}
public class SingleLL
{
	public LinkNode head;
	public SingleLL()
	{
		this.head = null;
	}
	// Add new node in sorted order
	public void sortedAdd(int data)
	{
		// Create new node
		LinkNode node = new LinkNode(data);
		if (this.head == null || this.head.data >= data)
		{
			// When linked list empty
			// or new nodes are adding at beginning
			node.next = this.head;
			this.head = node;
		}
		else
		{
			LinkNode temp = this.head;
			// Find position to add new node
			while (temp.next != null && temp.next.data < data)
			{
				// Visit to next node
				temp = temp.next;
			}
			node.next = temp.next;
			// Add new node
			temp.next = node;
		}
	}
	// Display linked list element
	public void display()
	{
		if (this.head == null)
		{
			return;
		}
		LinkNode temp = this.head;
		// iterating linked list elements
		while (temp != null)
		{
			System.out.print(" " + temp.data + " →");
			// Visit to next node
			temp = temp.next;
		}
		System.out.print(" NULL\n");
	}
	public static void main(String[] args)
	{
		SingleLL sll = new SingleLL();
		// Add Linked list node
		sll.sortedAdd(1);
		sll.sortedAdd(-3);
		sll.sortedAdd(9);
		sll.sortedAdd(4);
		sll.sortedAdd(11);
		sll.sortedAdd(-7);
		System.out.print(" Linked List \n");
		// -7 → -3 → 1 → 4 → 9 → 11 → NULL
		sll.display();
	}
}

Output

 Linked List
 -7 → -3 → 1 → 4 → 9 → 11 → NULL