OurBigBook
.com (beta)
About
$ Donate
Sign in
Sign up
by
Ciro Santilli
(@cirosantilli,
31
)
Post-order depth-first search (LRN, Postorder DFS)
Has the property of visiting all descendants before the parent.
Table of contents
Iterative post-order
Iterative post-order with two stacks
Iterative post-order
Iterative post-order with one stack
Iterative post-order
Iterative post-order
Post-order depth-first search
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
Iterative post-order with two stacks
Iterative post-order
www.geeksforgeeks.org/iterative-postorder-traversal/
Iterative post-order with one stack
Iterative post-order
www.geeksforgeeks.org/iterative-postorder-traversal-using-stack/
Ancestors
Depth-first search
Tree traversal
Tree
Type of graph
Graph
Discrete mathematics
Area of mathematics
Mathematics
Index
Incoming links
In-order depth-first search
Synonyms
cirosantilli/postorder-dfs
Discussion (0)
Subscribe (1)
Sign up
or
sign in
create discussions.
There are no discussions about this article yet.
View article source