Java program to delete a node from the end of the Circular Linked List
In this program, we will create a circular linked list and delete a node from the end of the list. If the list is empty, it will display the message "List is empty". If the list is not empty, we will loop through the list till second last node is reached. We will make second last node as the new tail, and this new tail will point to head and delete the previous tail.
Circular linked list after deleting node from end
Here, in the above list, D is the last node which needs to be deleted. We will iterate through the list till C. Make C as new tail and C will point back to head A.
- Define a Node class which represents a node in the list. It has two properties data and next which will point to the next node.
- Define another class for creating the circular linked list and it has two nodes: head and tail. It has two methods: deleteEnd() and display() .
- deleteEnd() will delete the node from the end of the list:
- It first checks whether the head is null (empty list) then, it will return from the function as there is no node present in the list.
- If the list is not empty, it will check whether 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, iterate through the loop till current.next!= tail.
- Now, current will point to the node previous to tail. Make current as new tail and tail will point to head thus, deletes the node from last.
a. display() will show all the nodes present in the list.
- Define a new node 'current' that will point to the head.
- Print current.data till current will points to head again.
- Current will point to the next node in the list in each iteration.
1 2 3 4
1 2 3
List is empty