  
      def find(self, data):
          if data is None:
              return None
          if self.head is None:
              return None
          curr_node = self.head
          while curr_node is not None:
              if curr_node.data == data:
                  return curr_node
              curr_node = curr_node.next
 
</s> remove             else:
                prev_node = curr_node
                curr_node = curr_node.next
 </s> add             prev_node = curr_node
            curr_node = curr_node.next </s> remove     "        if self.head is None:\n",
    "            return None\n",
 </s> add  </s> remove     "        curr_node = prev_node.next\n",
 </s> add     "        curr_node = self.head.next\n", </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",
  
      def find(self, data):
          if data is None:
              return None


          curr_node = self.head
          while curr_node is not None:
              if curr_node.data == data:
                  return curr_node
              curr_node = curr_node.next
keep keep keep keep 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