tree traversal methods (depth first)
Utilisateur anonyme
dfs basically use a LIFO Stack for the fringe. (see online or Artificial Intelligence: A Modern Approach) for pseduocode or actual implemention. You can easily find the code in Java/Python online I believe