Java program to delete a new node from the middle of the doubly linked list
In this program, we will create a doubly linked list and delete a node from the middle of the list. If the list is empty, display the message "List is empty". If the list is not empty, we will calculate the size of the list and then divide it by 2 to get the mid-point of the list. Current will point to head node. We will iterate through the list till mid?point is reached. Now current will point to the middle node. We delete middle node such that current's previous node will point to the current's next node.
Consider the above example, mid-point of above list is 3. Iterate current from head to mid-point. Now, the current is pointing to mid node which needs to be deleted. In this case, node new is the middle node which needs to be deleted. New can be deleted by making node 2 (current's previous node) to point to node 3 (current's next node). Set current to null.
a. display() will show all the nodes present in the list.
Original List: 1 2 3 4 5 Updated List: 1 2 4 5 Updated List: 1 4 5 Updated List: 1 5 Updated List: 5 Updated List: List is empty