2015年11月27日
[LeetCode] 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 roote 阅读全文
posted @ 2015-11-27 12:25 Grandyang 阅读(26137) 评论(10) 推荐(0) 编辑
Fork me on GitHub