Deletion in doubly linked list at the endDeletion of the last node in a doubly linked list needs traversing the list in order to reach the last node of the list and then make pointer adjustments at that position. In order to delete the last node of the list, we need to follow the following steps.
free the pointer as this the node which is to be deleted.
Write UNDERFLOW [END OF LOOP] C FunctionOutput 1.Append List 2.Delete node from end 3.Exit 4.Enter your choice?1 Enter the item 12 Node Inserted 1.Append List 2.Delete node from end 3.Exit 4.Enter your choice?1 Enter the item 90 Node Inserted 1.Append List 2.Delete node from end 3.Exit 4.Enter your choice?2 Node Deleted
Next TopicDoubly Linked List
|