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