      "        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",
      "        assert_equal(insert(node, 2).data, 2)\n",
      "        assert_equal(insert(node, 3).data, 3)\n",
      "        assert_equal(insert(node, 4).data, 4)\n",
      "        insert(node, 5)\n",
      "        in_order_traversal(node, self.results.add_result)\n",
      "        assert_equal(str(self.results), '[1, 2, 3, 4, 5]')\n",
      "\n",
      "        print('Success: test_tree')\n",
      "\n",
      "\n",
 
</s> remove     "        node = insert(None, 1)\n",
    "        assert_equal(insert(node, 2).data, 2)\n",
    "        assert_equal(insert(node, 3).data, 3)\n",
    "        assert_equal(insert(node, 4).data, 4)\n",
    "        insert(node, 5)\n",
    "        in_order_traversal(node, self.results.add_result)\n",
 </s> add     "    def test_tree_two(self):\n",
    "        bst = Bst()\n",
    "        bst.insert(1)\n",
    "        bst.insert(2)\n",
    "        bst.insert(3)\n",
    "        bst.insert(4)\n",
    "        bst.insert(5)\n",
    "        in_order_traversal(bst.root, self.results.add_result)\n", </s> remove     "    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",
    "        in_order_traversal(node, self.results.add_result)\n",
 </s> add     "    def test_tree_one(self):\n",
    "        bst = Bst()\n",
    "        bst.insert(5)\n",
    "        bst.insert(2)\n",
    "        bst.insert(8)\n",
    "        bst.insert(1)\n",
    "        bst.insert(3)\n",
    "        in_order_traversal(bst.root, self.results.add_result)\n", </s> remove     "    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",
    "        in_order_traversal(node, self.results.add_result)\n",
 </s> add     "    def test_tree_one(self):\n",
    "        bst = Bst()\n",
    "        bst.insert(5)\n",
    "        bst.insert(2)\n",
    "        bst.insert(8)\n",
    "        bst.insert(1)\n",
    "        bst.insert(3)\n",
    "        in_order_traversal(bst.root, self.results.add_result)\n", </s> remove     "    test.test_tree()\n",
 </s> add     "    test.test_tree_one()\n",
    "    test.test_tree_two()\n", </s> remove     "    test.test_tree()\n",
 </s> add     "    test.test_tree_one()\n",
    "    test.test_tree_two()\n",
    "    def test_tree_two(self):\n",
    "        bst = Bst()\n",
    "        bst.insert(1)\n",
    "        bst.insert(2)\n",
    "        bst.insert(3)\n",
    "        bst.insert(4)\n",
    "        bst.insert(5)\n",
    "        in_order_traversal(bst.root, self.results.add_result)\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",
    "    def test_tree_two(self):\n",
    "        bst = Bst()\n",
    "        bst.insert(1)\n",
    "        bst.insert(2)\n",
    "        bst.insert(3)\n",
    "        bst.insert(4)\n",
    "        bst.insert(5)\n",
    "        in_order_traversal(bst.root, self.results.add_result)\n",
    "    def test_tree_two(self):\n",
    "        bst = Bst()\n",
    "        bst.insert(1)\n",
    "        bst.insert(2)\n",
    "        bst.insert(3)\n",
    "        bst.insert(4)\n",
    "        bst.insert(5)\n",
    "        in_order_traversal(bst.root, self.results.add_result)\n",
    "    def test_tree_two(self):\n",
    "        bst = Bst()\n",
    "        bst.insert(1)\n",
    "        bst.insert(2)\n",
    "        bst.insert(3)\n",
    "        bst.insert(4)\n",
    "        bst.insert(5)\n",
    "        in_order_traversal(bst.root, self.results.add_result)\n",
    "    def test_tree_two(self):\n",
    "        bst = Bst()\n",
    "        bst.insert(1)\n",
    "        bst.insert(2)\n",
    "        bst.insert(3)\n",
    "        bst.insert(4)\n",
    "        bst.insert(5)\n",
    "        in_order_traversal(bst.root, self.results.add_result)\n",
    "    def test_tree_two(self):\n",
    "        bst = Bst()\n",
    "        bst.insert(1)\n",
    "        bst.insert(2)\n",
    "        bst.insert(3)\n",
    "        bst.insert(4)\n",
    "        bst.insert(5)\n",
    "        in_order_traversal(bst.root, self.results.add_result)\n",
    "    def test_tree_two(self):\n",
    "        bst = Bst()\n",
    "        bst.insert(1)\n",
    "        bst.insert(2)\n",
    "        bst.insert(3)\n",
    "        bst.insert(4)\n",
    "        bst.insert(5)\n",
    "        in_order_traversal(bst.root, self.results.add_result)\n",
      "        assert_equal(str(self.results), '[1, 2, 3, 4, 5]')\n",
      "\n",
      "        print('Success: test_tree')\n",
      "\n",
      "\n",
keep keep keep keep replace replace replace replace replace replace keep keep keep keep keep
 Move bst to a class 
graphs_trees/bst/bst_challenge.ipynb