Topological Sort - Minimum Height Trees (Centroid by Trimming)
Consider the following Python code implementing the optimal leaf trimming approach for Minimum Height Trees. Given
n = 4 and edges = [[1,0],[1,2],[1,3]], what is the final returned list?