              return
          if self.head is None:
              return
          if self.head.data == data:
              self.head = None
              return
          prev_node = self.head
          curr_node = self.head.next
          while curr_node is not None:
              if curr_node.data == data:
 
</s> remove             self.head = Node(data)
 </s> add             self.head = node </s> remove     "            self.head = None\n",
 </s> add     "            self.head = self.head.next\n", </s> remove     "            self.head = Node(data)\n",
 </s> add     "            self.head = node\n", </s> remove    "pygments_lexer": "ipython3",
   "version": "3.5.0"
 </s> add    "pygments_lexer": "ipython2",
   "version": "2.7.12" </s> remove     "version": 3
 </s> add     "version": 2
            self.head = self.head.next
              return
          if self.head is None:
              return
          if self.head.data == data:
            self.head = self.head.next
              return
          prev_node = self.head
          curr_node = self.head.next
          while curr_node is not None:
              if curr_node.data == data:
keep keep keep keep replace keep keep keep keep keep
 Fix #173: Bugs in linked list append and delete methods (#184) 
linked_lists/linked_list/linked_list.py