          while curr_node is not None:
              if curr_node.data == data:
                  prev_node.next = curr_node.next
                  return
              else:
                  prev_node = curr_node
                  curr_node = curr_node.next
  
      def delete_alt(self, data):
          if data is None:
              return
          if self.head is None:
 
</s> remove         curr_node = prev_node.next
 </s> add         curr_node = self.head.next </s> remove         if self.head is None:
            return None
 </s> add  </s> remove     "            else:\n",
    "                prev_node = curr_node\n",
    "                curr_node = curr_node.next\n",
 </s> add     "            prev_node = curr_node\n",
    "            curr_node = curr_node.next\n", </s> remove     "        curr_node = prev_node.next\n",
 </s> add     "        curr_node = self.head.next\n",
            prev_node = curr_node
            curr_node = curr_node.next
          while curr_node is not None:
              if curr_node.data == data:
                  prev_node.next = curr_node.next
                  return
            prev_node = curr_node
            curr_node = curr_node.next
            prev_node = curr_node
            curr_node = curr_node.next
            prev_node = curr_node
            curr_node = curr_node.next
  
      def delete_alt(self, data):
          if data is None:
              return
          if self.head is None:
keep keep keep keep replace replace replace keep keep keep keep keep
 Update linked list challenge (#124)

Remove extraneous check within the find method.  Clean up delete method. 
linked_lists/linked_list/linked_list.py