by

Ciro Santilli (@cirosantilli, 34)

Post-order depth-first search (LRN, Postorder DFS)

Has the property of visiting all descendants before the parent.

Table of contents
- Iterative post-order Post-order depth-first search
  - Iterative post-order with two stacks Iterative post-order
  - Iterative post-order with one stack Iterative post-order

Iterative post-order

 0  0 

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 (9)

 Incoming links (1)

In-order depth-first search

 Synonyms (1)

cirosantilli/postorder-dfs

 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