Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Binary Tree Inorder Traversal
Bookmark
Recursive
Iterative Stack
Visited Flags
Morris
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 visit node, then recurse right
4
2
5
1
3
call stack
recurse left, then visit node, then recurse right
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
left subtree done → visit
1
, append to result
4
2
5
1
3
call stack
4
2
result
1
subtree done → return, pop the call stack
4
2
5
1
3
call stack
4
2
3
result
1
2
enter
3
→ recurse into its left subtree
4
2
5
1
3
call stack
4
2
result
1
2
3
subtree done → return, pop the call stack
4
2
5
1
3
call stack
4
result
1
2
3
4
left subtree done → visit
4
, append to result
4
2
5
1
3
call stack
4
5
result
1
2
3
4
enter
5
→ recurse into its left subtree
4
2
5
1
3
call stack
4
result
1
2
3
4
5
subtree done → return, pop the call stack
4
2
5
1
3
call stack
result
1
2
3
4
5
[1, 2, 3, 4, 5]
algo
master
.
io
Step:
Start: inorder = recurse left, visit node, recurse right
0 / 16
Input
Small (5 nodes)
Example 1
Complete Tree
Custom
tree
=
[4, 2, 5, 1, 3]
0 / 16
algo
master
.
io
Step:
Start: inorder = recurse left, visit node, recurse right
