Breadth-first search traversal of a tree produces a string with the tree nodes in preorder.
Is the above statement a true assumption to make? If not, please advise with the exception case/s.
Ok, can now see that DFS (not BFS) and preorder are equivalent.