Implement doubly-linked list with O(1) operations

Author: RahwaZeslusHaile

Sprint-2/implement_linked_list/linked_list.py

@@ -24,7 +24,6 @@ def push_head(self, value):
         return new_node
 
     def pop_tail(self):
-       
         if self.tail is None:
             raise IndexError("pop_tail from empty linked list")
 
@@ -34,33 +33,24 @@ def pop_tail(self):
             self.head = None
             self.tail = None
         else:
-            # Remove from tail
             self.tail = self.tail.previous
             self.tail.next = None
 
         return value
 
     def remove(self, node):
-        """
-        Remove the given node from the list in O(1) time.
-        Takes a handle returned by push_head().
-        """
         if node is None:
             raise ValueError("Cannot remove None node")
 
         if node == self.head == self.tail:
-            # Only one element
             self.head = None
             self.tail = None
         elif node == self.head:
-            # Remove from head
             self.head = node.next
             self.head.previous = None
         elif node == self.tail:
-            # Remove from tail
             self.tail = node.previous
             self.tail.next = None
         else:
-            # Remove from middle
             node.previous.next = node.next
             node.next.previous = node.previous