      "    def __init__(self):\n",
      "        self.results = Results()\n",
      "\n",
      "    def test_dfs(self):\n",
      "        node = Node(5)\n",
      "        insert(node, 2)\n",
      "        insert(node, 8)\n",
      "        insert(node, 1)\n",
      "        insert(node, 3)\n",
      "\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",
 
</s> remove     "        node = Node(5)\n",
    "        insert(node, 2)\n",
    "        insert(node, 8)\n",
    "        insert(node, 1)\n",
    "        insert(node, 3)\n",
 </s> add     "        bst = BstDfs(Node(5))\n",
    "        bst.insert(2)\n",
    "        bst.insert(8)\n",
    "        bst.insert(1)\n",
    "        bst.insert(3)\n", </s> remove     "        in_order_traversal(node, self.results.add_result)\n",
 </s> add     "        bst.in_order_traversal(bst.root, self.results.add_result)\n", </s> remove     "        in_order_traversal(node, self.results.add_result)\n",
 </s> add     "        bst.in_order_traversal(bst.root, self.results.add_result)\n", </s> remove     "        node = Node(1)\n",
    "        insert(node, 2)\n",
    "        insert(node, 3)\n",
    "        insert(node, 4)\n",
    "        insert(node, 5)\n",
 </s> add     "        bst = BstDfs(Node(1))\n",
    "        bst.insert(2)\n",
    "        bst.insert(3)\n",
    "        bst.insert(4)\n",
    "        bst.insert(5)\n", </s> remove     "        node = Node(1)\n",
    "        insert(node, 2)\n",
    "        insert(node, 3)\n",
    "        insert(node, 4)\n",
    "        insert(node, 5)\n",
 </s> add     "        bst = BstDfs(Node(1))\n",
    "        bst.insert(2)\n",
    "        bst.insert(3)\n",
    "        bst.insert(4)\n",
    "        bst.insert(5)\n",
    "        bst = BstDfs(Node(5))\n",
    "        bst.insert(2)\n",
    "        bst.insert(8)\n",
    "        bst.insert(1)\n",
    "        bst.insert(3)\n",
      "    def __init__(self):\n",
      "        self.results = Results()\n",
      "\n",
      "    def test_dfs(self):\n",
    "        bst = BstDfs(Node(5))\n",
    "        bst.insert(2)\n",
    "        bst.insert(8)\n",
    "        bst.insert(1)\n",
    "        bst.insert(3)\n",
    "        bst = BstDfs(Node(5))\n",
    "        bst.insert(2)\n",
    "        bst.insert(8)\n",
    "        bst.insert(1)\n",
    "        bst.insert(3)\n",
    "        bst = BstDfs(Node(5))\n",
    "        bst.insert(2)\n",
    "        bst.insert(8)\n",
    "        bst.insert(1)\n",
    "        bst.insert(3)\n",
    "        bst = BstDfs(Node(5))\n",
    "        bst.insert(2)\n",
    "        bst.insert(8)\n",
    "        bst.insert(1)\n",
    "        bst.insert(3)\n",
    "        bst = BstDfs(Node(5))\n",
    "        bst.insert(2)\n",
    "        bst.insert(8)\n",
    "        bst.insert(1)\n",
    "        bst.insert(3)\n",
      "\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",
keep keep keep keep replace replace replace replace replace keep keep keep keep keep
 Move tree dfs to a class 
graphs_trees/tree_dfs/dfs_challenge.ipynb