Singly Linked List Deletion in Java

import java.lang.*;

class LinkedList {
    Node head;
    // Node Class
    class Node{
        int data;
        Node next;

        Node(int x) // parameterized constructor
        {
            data = x;
            next = null;
        }
    }
    public Node insertStart(int data)
    {
        // Creating newNode memory & assigning data value
        Node newNode = new Node(data);
        // assigning this newNode's next as current head node
        newNode.next = head;

        // re-assigning head to this newNode
        head = newNode;

        return head;
    }

    public void display()
    {
        Node node = head;
        //as linked list will end when Node reaches Null
        while(node!=null)
        {
            System.out.print(node.data + " ");
            node = node.next;
        }
        System.out.println();
    }
    void deleteVal(int value)
    {
        Node temp = head;
        Node previous = null;

        if(temp == null){
            System.out.println("Can't delete Linked List empty");
            return;
        }

        // Case when there is only 1 node in the list
        if(temp.next==null)
        {
            head = null;
            System.out.println("Deleted: " + value);
            return;
        }

        // if the head node itself needs to be deleted
        if(temp.data==value)
        {
            head = temp.next; //changing head to next in the list
            System.out.println("Deleted: " + value);
            return;
        }

        // traverse until we find the value to be deleted or LL ends
        while (temp != null && temp.data != value)
        {
            // store previous link node as we need to change its next val
            previous = temp;
            temp = temp.next;
        }

        // if value is not present then
        // temp will have traversed to last node NULL
        if(temp==null)
        {
            System.out.println("Value not found");
            return;
        }

        // for node to be deleted : temp lets call it nth node
        // assign (n-1)th node's next to (n+1)th node
        previous.next = temp.next;
        System.out.println("Deleted: " + value);
    }
}

public class Main
{
public static void main(String args[])
{
        LinkedList ll = new LinkedList();

        ll.insertStart(6);
        ll.insertStart(5);
        ll.insertStart(4);
        ll.insertStart(3);
        ll.insertStart(2);
        ll.insertStart(1);

        ll.display();

        ll.deleteVal(10);
        ll.deleteVal(5);
        ll.deleteVal(2);

        ll.display();

        ll.deleteVal(1);
        ll.display();

    }
}

import java.lang.*;

// Node Class
class Node {
    int data;
    Node next;

    Node(int x) // parameterized constructor
    {
        data = x;
        next = null;
    }
}

class Main
{
    static Node insert(Node head, int data)
    {
        // Creating newNode memory & assigning data value
        Node newNode = new Node(data);

        // assigning this newNode's next as current head node
        newNode.next = head;
        // re-assigning head to this newNode
        head = newNode;

        return head;
    }

    static Node deleteVal(Node head, int value)
    {
        Node temp = head;
        Node previous = null;

        if(temp == null){
            System.out.println("Can't delete Linked List empty");
            return head;
        }

        // Case when there is only 1 node in the list
        if(temp.next==null)
        {
            head = null;
            System.out.println("Deleted: " + value);
            return head;
        }

        // if the head node itself needs to be deleted
        if(temp.data==value)
        {
            head = temp.next; //changing head to next in the list
            System.out.println("Deleted: " + value);
            return head;
        }

        // traverse until we find the value to be deleted or LL ends
        while (temp != null && temp.data != value)
        {
            // store previous link node as we need to change its next val
            previous = temp;
            temp = temp.next;
        }

        // if value is not present then
        // temp will have traversed to last node NULL
        if(temp==null)
        {
            System.out.println("Value not found");
            return head;
        }

        // for node to be deleted : temp lets call it nth node
        // assign (n-1)th node's next to (n+1)th node
        previous.next = temp.next;
        System.out.println("Deleted: " + value);
        return head;
    }

    static void display(Node node) {

        //as linked list will end when Node is Null
        while (node != null) {
            System.out.print(node.data + " ");
            node = node.next;
        }
        System.out.println();
    }

    public static void main(String args[])
    {
        Node head = null;
        head = insert(head,6);
        head = insert(head,5);
        head = insert(head,4);
        head = insert(head,3);
        head = insert(head,2);
        head = insert(head,1);

        display(head);

        head = deleteVal(head,10);
        head = deleteVal(head,5);
        head = deleteVal(head,2);

        display(head);

        head = deleteVal(head,1);
        display(head);

    }
}