Learn
Practice
Newsletter
Resources
Mobile
New
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Average of Levels in Binary Tree
Bookmark
Input
Example 1
Complete Tree
Large Values
Four Levels
Custom
tree
=
[3, 9, 20, null, null, 15, 7]
3
9
20
15
7
L0
L1
L2
queue
result
level-order traversal (BFS)
3
9
20
15
7
L0
L1
L2
queue
result
level-order traversal (BFS)
3
9
20
15
7
L0
L1
L2
queue
3
front
result
level 0:
1 node,
sum = 0
3
9
20
15
7
L0
L1
L2
queue
9
front
result
enqueue
9
3
9
20
15
7
L0
3
L1
L2
queue
9
20
front
result
3
avg =
3 / 1
=
3
3
9
20
15
7
L0
3
L1
L2
queue
20
front
result
3
sum =
9
3
9
20
15
7
L0
3
L1
L2
queue
result
3
sum =
9 + 20
=
29
3
9
20
15
7
L0
3
L1
L2
queue
15
7
front
result
3
enqueue
7
3
9
20
15
7
L0
3
L1
14.5
L2
queue
15
7
front
result
3
14.5
level 2:
2 nodes,
sum = 0
3
9
20
15
7
L0
3
L1
14.5
L2
queue
result
3
14.5
sum =
15 + 7
=
22
3
9
20
15
7
L0
3
L1
14.5
L2
11
queue
result
3
14.5
11
return [3, 14.5, 11]
algo
master
.
io
Step:
Start: compute the average of each level with BFS
0 / 17
Input
Example 1
Complete Tree
Large Values
Four Levels
Custom
tree
=
[3, 9, 20, null, null, 15, 7]
0 / 17
algo
master
.
io
Step:
Start: compute the average of each level with BFS
