OurBigBook About$ Donate
 Sign in+ Sign up
by Ciro Santilli (@cirosantilli, 37)

Iterative post-order

 ... Graph (discrete mathematics) Type of graph Tree (data structure) Tree traversal Depth-first search Post-order depth-first search
 0 By others on same topic  0 Discussions  Updated 2025-05-29  +Created 1970-01-01  See my version
This is the hardest one to do iteratively.
Bibliography:
  • stackoverflow.com/questions/1294701/post-order-traversal-of-binary-tree-without-recursion
  • stackoverflow.com/questions/50645284/non-recursive-post-order-graph-traversal
  • Table of contents
    • Iterative post-order with two stacks Iterative post-order
    • Iterative post-order with one stack Iterative post-order

Iterative post-order with two stacks

 0  0 
Iterative post-order
www.geeksforgeeks.org/iterative-postorder-traversal/

Iterative post-order with one stack

 0  0 
Iterative post-order
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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook