      "## Constraints\n",
      "\n",
      "* Can we assume this is a non-circular, singly linked list?\n",
      "    * Yes\n",
      "* What if the final node is being deleted, for example a single node list?  Do we make it a dummy with value None?\n",
      "    * Yes\n",
      "* Can we assume we already have a linked list class that can be used for this problem?\n",
      "    * Yes"
     ]
    },
 
</s> remove     "* What if the final node is being deleted, for example a single node list?  Do we make it a dummy with value None?\n",
 </s> add     "* What if the final node is being deleted, do we make it a dummy with value None?\n", </s> remove     "        if self.head is None or node is None:\n",
    "            return\n",
    "        if self.head == node:\n",
    "            self.head = None\n",
 </s> add     "        if node is None:\n", </s> remove     "            node.next = None\n",
 </s> add  </s> remove     "        linked_list.delete_node(node2)\n",
    "        assert_equal(linked_list.get_all_data(), [1, 3, 1])\n",
 </s> add     "        linked_list.delete_node(node1)\n",
    "        assert_equal(linked_list.get_all_data(), [1, 4, 2])\n",
    "\n",
    "        print('Test: Multiple nodes, delete last element')\n",
    "        linked_list = MyLinkedList(None)\n",
    "        node0 = linked_list.insert_to_front(2)\n",
    "        node1 = linked_list.insert_to_front(3)\n",
    "        node2 = linked_list.insert_to_front(4)\n",
    "        node3 = linked_list.insert_to_front(1)\n",
    "        linked_list.delete_node(node0)\n",
    "        assert_equal(linked_list.get_all_data(), [1, 4, 3, None])\n", </s> remove     "        assert_equal(linked_list.get_all_data(), [])\n",
 </s> add     "        assert_equal(linked_list.get_all_data(), [None])\n",
    "* What if the final node is being deleted, do we make it a dummy with value None?\n",
      "## Constraints\n",
      "\n",
      "* Can we assume this is a non-circular, singly linked list?\n",
      "    * Yes\n",
    "* What if the final node is being deleted, do we make it a dummy with value None?\n",
      "    * Yes\n",
      "* Can we assume we already have a linked list class that can be used for this problem?\n",
      "    * Yes"
     ]
    },
keep keep keep keep replace keep keep keep keep keep
 Update LL delete mid challenge (#112)

Update constraints and assumptions, solution, and test case. 
linked_lists/delete_mid/delete_mid_challenge.ipynb