Python Data Structures and Algorithms

Delete operation

Unlike the singly linked list, where we needed to keep track of the previously encountered node anytime we traversed the whole length of the list, the doubly linked list avoids that whole step. This is made possible by the use of the previous pointer. 

The algorithm for removing nodes from a doubly linked list caters for basically four scenarios before deletion of a node is completed. These are:

• When the search item is not found at all
• When the search item is found at the very beginning of the list
• When the search item is found at the tail end of the list
• When the search item is found somewhere in the middle of the list

The node to be removed is identified when its data instance variable matches the data that is passed ...