      "        self.results = Results()\n",
      "\n",
      "    def test_tree(self):\n",
      "        node = Node(5)\n",
      "        insert(node, 2)\n",
      "        insert(node, 8)\n",
      "        insert(node, 1)\n",
      "        insert(node, 3)\n",
      "        in_order_traversal(node, self.results.add_result)\n",
      "        assert_equal(str(self.results), '[1, 2, 3, 5, 8]')\n",
      "        self.results.clear_results()\n",
      "\n",
      "        node = insert(None, 1)\n",
 
</s> remove     "            insert(root.left, data)\n",
 </s> add     "            return insert(root.left, data)\n", </s> remove     "            insert(root.right, data)"
 </s> add     "            return insert(root.right, data)" </s> remove             insert(root.left, data)
 </s> add             return insert(root.left, data)
    "        assert_equal(insert(node, 2).data, 2)\n",
    "        assert_equal(insert(node, 8).data, 8)\n",
    "        assert_equal(insert(node, 1).data, 1)\n",
    "        assert_equal(insert(node, 3).data, 3)\n",
      "        self.results = Results()\n",
      "\n",
      "    def test_tree(self):\n",
      "        node = Node(5)\n",
    "        assert_equal(insert(node, 2).data, 2)\n",
    "        assert_equal(insert(node, 8).data, 8)\n",
    "        assert_equal(insert(node, 1).data, 1)\n",
    "        assert_equal(insert(node, 3).data, 3)\n",
    "        assert_equal(insert(node, 2).data, 2)\n",
    "        assert_equal(insert(node, 8).data, 8)\n",
    "        assert_equal(insert(node, 1).data, 1)\n",
    "        assert_equal(insert(node, 3).data, 3)\n",
    "        assert_equal(insert(node, 2).data, 2)\n",
    "        assert_equal(insert(node, 8).data, 8)\n",
    "        assert_equal(insert(node, 1).data, 1)\n",
    "        assert_equal(insert(node, 3).data, 3)\n",
    "        assert_equal(insert(node, 2).data, 2)\n",
    "        assert_equal(insert(node, 8).data, 8)\n",
    "        assert_equal(insert(node, 1).data, 1)\n",
    "        assert_equal(insert(node, 3).data, 3)\n",
      "        in_order_traversal(node, self.results.add_result)\n",
      "        assert_equal(str(self.results), '[1, 2, 3, 5, 8]')\n",
      "        self.results.clear_results()\n",
      "\n",
      "        node = insert(None, 1)\n",
keep keep keep keep replace replace replace replace keep keep keep keep keep
 Update bst insert to return the inserted node (#81) 
graphs_trees/bst/bst_challenge.ipynb