                  return curr_node
              else:
                  curr_node = curr_node.next
                  
      def delete(self, data):
          if data is None:
              return
 
</s> remove             curr_node = curr_node.next </s> add 
        return
                  return curr_node
              else:
                  curr_node = curr_node.next
        return
                  
      def delete(self, data):
          if data is None:
              return
keep keep add keep keep keep keep
 Reworked notebook: Added more detail to constraints and test cases.  Reworked algorithm discussion, code, and unit test. 
linked-lists/linked_list.py