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.