by Ciro Santilli (@cirosantilli, 36)

Iterative post-order

This is the hardest one to do iteratively.
Bibliography:

Iterative post-order with two stacks

0 0
www.geeksforgeeks.org/iterative-postorder-traversal/

Iterative post-order with one stack

0 0
www.geeksforgeeks.org/iterative-postorder-traversal-using-stack/

Ancestors (10)

  1. Post-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

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