Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 310. Minimum Height Trees
Given an undirected tree, return all node labels that, when chosen as root, yield the minimum possible tree height. This is equivalent to finding the tree's centroid(s) — commonly done by iteratively trimming leaf layers until one or two central nodes remain.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.