PAT甲级练习题A1021. Deepest Root (25)
题目描述A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a ro
原创
2016-08-15 17:05:27 ·
251 阅读 ·
0 评论
关注
分享
扫一扫