Java program to delete a node from the beginning of the singly linked list
In this program, we will create a singly linked list and delete a node from the beginning of the list. To accomplish this task, we need to make the head pointer pointing to the immediate next of the initial node which will now become the new head node of the list.
Consider the above example; Node was the head of the list. Make head to point to next node in the list. Now, node 1 will become the new head of the list. Thus, deleting the Node.
- Create a class Node which has two attributes: data and next. Next is a pointer to the next node in the list.
- Create another class DeleteStart which has two attributes: head and tail.
- addNode() will add a new node to the list:
- Create a new node.
- It first checks, whether the head is equal to null which means the list is empty.
- If the list is empty, both head and tail will point to a newly added node.
- If the list is not empty, the new node will be added to end of the list such that tail's next will point to a newly added node. This new node will become the new tail of the list.
a. deleteFromStart() will delete a node from the beginning of the list:
- It first checks whether the head is null (empty list) then, display the message "List is empty" and return.
- If the list is not empty, it will check whether the list has only one node.
- If the list has only one node, it will set both head and tail to null.
- If the list has more than one node then, the head will point to the next node in the list and delete the old head node.
a. display() will display the nodes present in the list:
- Define a node current which will initially point to the head of the list.
- Traverse through the list till current points to null.
- Display each node by making current to point to node next to it in each iteration.
1 2 3 4
2 3 4
List is empty