Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 310. Minimum Height Trees
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source