Thanks for your explaination.
Quote Originally Posted by Zachm View Post
DFS is a general search algorithm for graphs, not just for trees, and as such, it needs to be informed which nodes have already been visited since it might be possible to reach the same node several times from different paths.
The implementation you suggested only fits binary trees, and won't work for any general graph.

Regards,
Zachm