by Ciro Santilli (@cirosantilli, 37)
This is the easiest one to do iteratively:
  • pop and visit
  • push right to stack
  • push left to stack

Ancestors (10)

  1. Pre-order depth-first search
  2. Depth-first search
  3. Tree traversal
  4. Tree (data structure)
  5. Type of graph
  6. Graph (discrete mathematics)
  7. Discrete mathematics
  8. Area of mathematics
  9. Mathematics
  10. Home

Incoming links (1)

View article source

Discussion (0)

+ New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic + Create my own version