Learn
Practice
Newsletter
Resources
Animations
New
F
Toggle theme
0
F
0
Toggle menu
← 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
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
1
2
3
4
5
diameter
0
diameter = longest path between any two nodes
algo
master
.
io
Step:
Start: the diameter is the longest path between any two nodes
