Roadmap DSA Tracker Code Editor Tech Blogs

Loading question...

The ultimate platform to master JavaScript interviews. Comprehensive questions, interactive practice, and detailed explanations.

Explore

Home
Practice Arena
Browse Topics
All Questions

Resources

Learning Roadmap
Cheatsheets
Tech Blog
Community

Stay Updated

Get the latest interview questions and tips delivered to your inbox.

Join 5,000+ developers

© 2026 JS Interview Prep. Made withby developers.

Privacy Terms Cookies

Buy Me A Coffee

Minimum Height Trees

Medium

00:00

0 users online

Given a tree with n nodes, find all root labels of Minimum Height Trees.

Sample Input:

4, [[1,0],[1,2],[1,3]]

Sample Output:

[1]

Hints

Hint 1

MHT roots are centroids of the tree

Hint 2

Trim leaves layer by layer until ≤ 2 nodes remain

Hint 3

Use BFS from all leaves simultaneously

Code Editor

Loading...