Delete middle node from linked list in java

Java program for Delete middle node from linked list. Here problem description and explanation.

/*
    Java program for
    Delete middle node 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;
    }
    // Adding new node at beginning of linked list
    public void addNode(int data)
    {
        // Create new node
        LinkNode node = new LinkNode(data);
        // Connect current node to previous head
        node.next = this.head;
        this.head = node;
    }
    // Display linked list element
    public void display()
    {
        if (this.head == null)
        {
            return;
        }
        LinkNode temp = this.head;
        // iterating linked list elements
        while (temp != null)
        {
            // Display node value
            System.out.print(" " + temp.data + " →");
            // Visit to next node
            temp = temp.next;
        }
        System.out.print(" NULL\n");
    }
    // Delete the middle node of linked list
    public void deleteMid()
    {
        if (this.head == null)
        {
            // When linked list are no elements
            System.out.println("Empty Linked List");
        }
        else if (this.head.next == null && 
                 this.head.next.next == null)
        {
            // When linked list are less than  of 3 nodes
            System.out.println("Less then 3 node of linked list");
        }
        else
        {
            LinkNode temp = this.head;
            LinkNode midPrevious = null;
            // Find the middle and its previous node
            while (temp != null && 
                   temp.next != null && 
                   temp.next.next != null)
            {
                if (midPrevious == null)
                {
                    // When first node
                    midPrevious = temp;
                }
                else
                {
                    // Visit to next node
                    midPrevious = midPrevious.next;
                }
                // Visit to next second next node
                temp = temp.next.next;
            }
            // Get the node which is deleting 
            temp = midPrevious.next;
            // Show deleted node
            System.out.println("Delete node : " + temp.data);
            // Change link
            midPrevious.next = temp.next;
        }
    }
    public static void main(String[] args)
    {
        SingleLL sll = new SingleLL();
        // Linked list
        // 7 → 6 → 5 → 4 → 3 → 2 → 1 → NULL
        sll.addNode(1);
        sll.addNode(2);
        sll.addNode(3);
        sll.addNode(4);
        sll.addNode(5);
        sll.addNode(6);
        sll.addNode(7);
        System.out.println("Before Delete middle node");
        sll.display();
        // Delete middle node
        sll.deleteMid();
        System.out.println("After Delete middle node");
        sll.display();
    }
}

Output

Before Delete middle node
 7 → 6 → 5 → 4 → 3 → 2 → 1 → NULL
Delete node : 4
After Delete middle node
 7 → 6 → 5 → 3 → 2 → 1 → NULL