Python Data Structures and Algorithms

List search

The search algorithm is similar to that of the search method in a singly linked list. We call the internal method iter() to return the data in all the nodes. As we loop through the data, each is matched against the data passed into the contain method. If there is a match, we return True, or else we return False to symbolize that no match was found:

    def contain(self, data):         for node_data in self.iter():             if data == node_data:                 return True             return False 

Our doubly linked list has a O(1) for the append operation and O(n) for the delete operation.