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.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 310. Minimum Height Trees

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact