Topological Sort - Minimum Height Trees (Centroid by Trimming)
You are given an undirected tree with
n nodes. The task is to find all nodes that, when chosen as roots, produce trees with minimum height. Which algorithmic approach best guarantees an optimal solution for this problem?