updat remove function to handle when node points to other next node in the linked list - if so reposition pointers so curent node is removed. else if the current node is the tail make the previous node to it the "new" tail

Author: HassanOHOsman

Sprint-2/implement_linked_list/linked_list.py

@@ -44,6 +44,12 @@ def remove(self, node):
             node.previous.next = node.next
         else:
             self.head = node.next
+
+        if node.next is not None:
+            node.next.previous = node.previous
+        else:
+            self.tail = node.previous
+