Learn
Practice
Newsletter
Resources
Animations
New
F
Toggle theme
0
F
0
Toggle menu
← Back to All Animations
Sum of Distances in Tree
Bookmark
Input
Standard
Small
Path
Custom
n
=
6
,
edges
=
[[0,1],[0,2],[2,3],[2,4],[2,5]]
0
root
1
2
3
4
5
setup
answer[0] = 0
count
0
1
1
1
2
1
3
1
4
1
5
1
answer
0
0
1
0
2
0
3
0
4
0
5
0
root at
0
· count[] = subtree sizes · answer[] = distance sums
algo
master
.
io
Step:
Sum of Distances in Tree: distance sum for every node
0 / 29
Input
Standard
Small
Path
Custom
n
=
6
,
edges
=
[[0,1],[0,2],[2,3],[2,4],[2,5]]
0 / 29
0
root
1
2
3
4
5
setup
answer[0] = 0
count
0
1
1
1
2
1
3
1
4
1
5
1
answer
0
0
1
0
2
0
3
0
4
0
5
0
root at
0
· count[] = subtree sizes · answer[] = distance sums
algo
master
.
io
Step:
Sum of Distances in Tree: distance sum for every node
