算法设计与分析（三）：Graph And Tree

Minimum Height Trees

---

For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called minimum height trees (MHTs). Given such a graph, write a function to find all the MHTs and return a list of their root labels.
Format
The graph contains n nodes which are labeled from 0 to n - 1. You will be given the number n and a list of undirected edges (each edge is a pair of labels).
You can assume that no duplicate edges will appear in edges. Since all edges are undirected, [0, 1] is the same as [1, 0] and thus will not appear together in edges.

Input: n = 4, edges = [[1, 0], [1, 2], [1, 3]]


        0
        |
        1
       / \
      2   3 

Output: [1]

---

题目要求给出一个呈现树结构的无向图，要求求出以图中的哪些顶点作为树的顶点时，生成树的高度最小，并输出这些顶点。<