Learn
Practice
Newsletter
Resources
Mobile
New
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Diameter of Binary Tree
Bookmark
Input
Example 1
Example 2
Longer Path
Custom
tree
=
[1, 2, 3, 4, 5]
1
2
3
4
5
diameter
0
diameter = longest path between any two nodes
1
2
3
4
5
diameter
0
diameter = longest path between any two nodes
1
2
3
4
5
diameter
0
calculateHeight(
2
)
1
2
3
4
5
diameter
0
left is null: height
0
1
2
3
4
5
h=1
diameter
0
h = 1 + max(
0
,
0
) =
1
1
2
3
4
5
h=1
diameter
0
left is null: height
0
1
2
3
4
5
h=1
h=1
diameter
0
h = 1 + max(
0
,
0
) =
1
1
2
3
4
5
h=2
h=1
h=1
diameter
2
h = 1 + max(
0
,
1
) =
2
1
2
3
4
5
h=2
h=1
h=1
diameter
2
right is null: height
0
1
2
3
4
5
h=2
h=1
h=1
h=1
diameter
2
h = 1 + max(
0
,
0
) =
1
1
2
3
4
5
h=3
h=2
h=1
h=1
h=1
diameter
3
return 3
algo
master
.
io
Step:
Start: the diameter is the longest path between any two nodes
0 / 32
Input
Example 1
Example 2
Longer Path
Custom
tree
=
[1, 2, 3, 4, 5]
0 / 32
algo
master
.
io
Step:
Start: the diameter is the longest path between any two nodes
