Content-Length: 647 | pFad | http://github.com/codebasics/data-structures-algorithms-python/pull/61.diff
thub.com diff --git a/data_structures/3_LinkedList/Solution/singly_linked_list_exercise.py b/data_structures/3_LinkedList/Solution/singly_linked_list_exercise.py index cce871c..4220353 100644 --- a/data_structures/3_LinkedList/Solution/singly_linked_list_exercise.py +++ b/data_structures/3_LinkedList/Solution/singly_linked_list_exercise.py @@ -91,9 +91,6 @@ def insert_after_value(self, data_after, data_to_insert): if self.head is None: return - if self.head.data==data_after: - self.head.next = Node(data_to_insert,self.head.next) - return itr = self.head while itr:Fetched URL: http://github.com/codebasics/data-structures-algorithms-python/pull/61.diff
Alternative Proxies: