CareerCup

Yes! DFS and Preorder are equivalent.
BFS is a totally different beast compare to preorder, inorder, and postorder.
Here is the link to tree traversal algorithms.
http://en.wikipedia.org/wiki/Tree_traversal

ya BFS order is nothing but level order

ya BFS order is nothing but level order

1
/ \
2 3
/ \ / \
4 5 6 7
\ \ / /
8
How about this case? ( start from vertex 1)

With preorder, my answer is 12485367

With DFS, my answer is 12485637

what's the problem?

1
/ \
2 3
/ \ / \
4 5 6 7
\ \ / /
8
How about this case? ( start from vertex 1)

With preorder, my answer is 12485367

With DFS, my answer is 12485637

what's the problem?

1
/ \
2 3
/ \ / \
4 5 6 7
\ \ / /
8
How about this case? ( start from vertex 1)

With preorder, my answer is 12485367

With DFS, my answer is 12485637

what's the problem?

I'm sorry to sent to many times. >"<

As you know Pre-order is a kind of DFS traversal. But in DFS traversal I guess right child can be traversed before left child. Where as in pre-order, left has to be traversed before right.

Your example for tree, giving preoder and DFS result different, as Preorder is for binary tree only, and any node in binary tree cannot have a single right child without having left child. So, above example is not a binary tree.

BSF is an mirror image of the post order