Java Program to Delete a Node From the Ending of the Circular Linked List
In this article, we will learn about deleting a node from the ending of a circular linked list. Consider the linked list as shown below:
Input : 5->3->4->(head node) Output: 5->3->(head node)
We will first initialize the list and add some data into it with the addNode() method and then proceed according to the below approaches:
Case 1: List is empty.
If the list is empty we will simply return.
Case 2: List is not empty
- Return from the function if no node is present
- Sets both head and tail to null if only one node is there
- if it has more than one node then it removes the previous head node, the head will point to the next node in the list and tail will point to the new head.
- printNode() will print all the nodes present in the list as:
- Node current is defined which will point to the head
- Print current.val till it starts pointing to the head again
- In each iteration, it will point to the next node
Original List: 5 3 4 Updated List: 5 3 Updated List: 5 Updated List: List is empty
Time complexity: O(n) where n is no of nodes of circular linked list
Auxiliary Space: O(1)