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


      "        curr_node = self.head\n",
      "        while curr_node is not None:\n",
      "            if curr_node.data == data:\n",
      "                return curr_node\n",
      "            curr_node = curr_node.next\n",
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_solution.ipynb