Learn
Practice
Newsletter
Resources
Animations
New
F
Toggle theme
0
F
0
Toggle menu
← Back to All Animations
Binary Tree Level Order Traversal
Bookmark
Input
Example 1
Complete Tree
Four Levels
Custom
tree
=
[3, 9, 20, null, null, 15, 7]
3
9
20
15
7
L0
L1
L2
queue
level
result
level-order traversal (BFS)
algo
master
.
io
Step:
Start: traverse the tree level by level with BFS
0 / 21
Input
Example 1
Complete Tree
Four Levels
Custom
tree
=
[3, 9, 20, null, null, 15, 7]
0 / 21
3
9
20
15
7
L0
L1
L2
queue
level
result
level-order traversal (BFS)
algo
master
.
io
Step:
Start: traverse the tree level by level with BFS
