          root.insert(1)
          root.insert(3)
  
          with captured_output() as (out, err):
              root.bfs(sys.stdout.write)
              assert_equal(out.getvalue().strip(), '52813')
  
          print('Success: test_bfs')
  
  
 
</s> remove         root = Node(5)
        root.insert(2)
        root.insert(8)
        root.insert(1)
        root.insert(3)
 </s> add         node = Node(5)
        insert(node, 2)
        insert(node, 8)
        insert(node, 1)
        insert(node, 3) </s> remove     "            root.bfs(sys.stdout.write)\n",
 </s> add     "            bfs(node, sys.stdout.write)\n", </s> remove     "        root = Node(5)\n",
    "        root.insert(2)\n",
    "        root.insert(8)\n",
    "        root.insert(1)\n",
    "        root.insert(3)\n",
 </s> add     "        node = Node(5)\n",
    "        insert(node, 2)\n",
    "        insert(node, 8)\n",
    "        insert(node, 1)\n",
    "        insert(node, 3)\n", </s> remove    "execution_count": 4,
 </s> add    "execution_count": 5, </s> remove    "execution_count": 3,
 </s> add    "execution_count": 4,
            bfs(node, sys.stdout.write)
          root.insert(1)
          root.insert(3)
  
          with captured_output() as (out, err):
            bfs(node, sys.stdout.write)
              assert_equal(out.getvalue().strip(), '52813')
  
          print('Success: test_bfs')
  
  
keep keep keep keep replace keep keep keep keep keep
 Simpilfied breadth first search challenge. 
graphs_trees/tree_bfs/test_bfs.py