Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Minimum Height Trees
Bookmark
BFS from Every Node
Leaf Trimming
Input
Example 1
Star Graph
Linear
Custom
n
=
6
,
edges
=
[[3,0],[3,1],[3,2],[3,4],[5,4]]
0
1
2
3
4
5
Queue:
Heights:
MHT Roots:
Legend:
Unreached
Expanding
Reached
Root
0
1
2
3
4
5
Queue:
Heights:
MHT Roots:
Legend:
Unreached
Expanding
Reached
Root
0
1
2
3
4
5
root
Queue:
2
4
front
rear
Heights:
-
0
-
1
-
2
-
3
-
4
-
5
MHT Roots:
Legend:
Unreached
Expanding
Reached
Root
0
1
2
3
4
5
root
Queue:
Heights:
3
0
-
1
-
2
-
3
-
4
-
5
MHT Roots:
Legend:
Unreached
Expanding
Reached
Root
0
1
2
3
4
5
root
Queue:
Heights:
3
0
-
1
-
2
-
3
-
4
-
5
MHT Roots:
Legend:
Unreached
Expanding
Reached
Root
0
1
2
3
4
5
root
Queue:
1
4
front
rear
Heights:
3
0
3
1
-
2
-
3
-
4
-
5
MHT Roots:
Legend:
Unreached
Expanding
Reached
Root
0
1
2
3
4
5
root
Queue:
0
1
front
rear
Heights:
3
0
3
1
3
2
-
3
-
4
-
5
MHT Roots:
Legend:
Unreached
Expanding
Reached
Root
0
1
2
3
4
5
root
Queue:
Heights:
3
0
3
1
3
2
2
3
-
4
-
5
MHT Roots:
Legend:
Unreached
Expanding
Reached
Root
0
1
2
3
4
5
root
Queue:
0
1
2
front
rear
Heights:
3
0
3
1
3
2
2
3
-
4
-
5
MHT Roots:
Legend:
Unreached
Expanding
Reached
Root
0
1
2
3
4
5
root
Queue:
3
front / rear
Heights:
3
0
3
1
3
2
2
3
2
4
-
5
MHT Roots:
Legend:
Unreached
Expanding
Reached
Root
0
1
2
3
4
5
Queue:
Heights:
3
0
3
1
3
2
2
3
2
4
3
5
MHT Roots:
3
4
Legend:
Unreached
Expanding
Reached
Root
algo
master
.
io
Step:
n = 6, so every node has to be measured
0 / 163
Input
Example 1
Star Graph
Linear
Custom
n
=
6
,
edges
=
[[3,0],[3,1],[3,2],[3,4],[5,4]]
0 / 163
algo
master
.
io
Step:
n = 6, so every node has to be measured
