Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Binary Tree Postorder Traversal
Bookmark
Recursive DFS
Reverse Preorder
Single Stack
Input
Small (5 nodes)
Example 1
Complete Tree
Custom
tree
=
[4, 2, 5, 1, 3]
4
2
5
1
3
call stack
recurse left, then right, then visit the node
4
2
5
1
3
call stack
recurse left, then right, then visit the node
4
2
5
1
3
call stack
4
2
enter
2
→ recurse into its left subtree
4
2
5
1
3
call stack
4
2
1
result
1
both subtrees done → visit
1
, append to result
4
2
5
1
3
call stack
4
2
result
1
left done → recurse into
2
.right
4
2
5
1
3
call stack
4
2
3
result
1
left done → recurse into
3
.right
4
2
5
1
3
call stack
4
2
result
1
3
2
both subtrees done → visit
2
, append to result
4
2
5
1
3
call stack
4
result
1
3
2
left done → recurse into
4
.right
4
2
5
1
3
call stack
4
5
result
1
3
2
left done → recurse into
5
.right
4
2
5
1
3
call stack
4
result
1
3
2
5
4
both subtrees done → visit
4
, append to result
4
2
5
1
3
call stack
result
1
3
2
5
4
[1, 3, 2, 5, 4]
algo
master
.
io
Step:
Start: postorder = recurse left, recurse right, then visit the node
0 / 21
Input
Small (5 nodes)
Example 1
Complete Tree
Custom
tree
=
[4, 2, 5, 1, 3]
0 / 21
algo
master
.
io
Step:
Start: postorder = recurse left, recurse right, then visit the node
