      "        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",
      "        pre_order_traversal(node, self.results.add_result)\n",
      "        assert_equal(str(self.results), \"[5, 2, 1, 3, 8]\")\n",
 
</s>
    "        bst.in_order_traversal(bst.root, self.results.add_result)\n",
      "        insert(node, 8)\n",
      "        insert(node, 1)\n",
      "        insert(node, 3)\n",
      "\n",
    "        bst.in_order_traversal(bst.root, self.results.add_result)\n",
      "        assert_equal(str(self.results), \"[1, 2, 3, 5, 8]\")\n",
      "        self.results.clear_results()\n",
      "\n",
      "        pre_order_traversal(node, self.results.add_result)\n",
      "        assert_equal(str(self.results), \"[5, 2, 1, 3, 8]\")\n",
keep keep keep keep replace keep keep keep keep keep
 Move tree dfs to a class
graphs_trees/tree_dfs/dfs_solution.ipynb