OurBigBook
About
$
Donate
Sign in
Sign up
by
Ciro Santilli
(
@cirosantilli,
34
)
Post-order depth-first search
(LRN, Postorder DFS)
...
Discrete mathematics
Graph
Type of graph
Tree
Tree traversal
Depth-first search
Like
(0)
0 By others
on same topic
0 Discussions
Updated
2024-11-15
Created
1970-01-01
See my version
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
0
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
0
0
0
Iterative post-order
www.geeksforgeeks.org/iterative-postorder-traversal/
Iterative post-order with one stack
0
0
0
Iterative post-order
www.geeksforgeeks.org/iterative-postorder-traversal-using-stack/
Ancestors
(9)
Depth-first search
Tree traversal
Tree
Type of graph
Graph
Discrete mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
In-order depth-first search
Synonyms
(1)
cirosantilli/postorder-dfs
View article source
Discussion
(0)
Subscribe (1)
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
