1021 Deepest Root (25 分)-PAT甲级

神笔码农.

已于 2022-03-06 17:21:05 修改

阅读量619

点赞数 1

分类专栏： PAT甲级刷题之路

于 2022-03-06 17:13:01 首次发布

本文链接：https://blog.csdn.net/m0_63520117/article/details/123293716

版权

c++ 数据结构深度优先

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 root is called the deepest root.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (≤104) which is the number of nodes, and hence the nodes are numbered from 1 to N. Then N−1 lines follow, each describes an edge（边） by given the two adjacent（相邻的） nodes' numbers.

Output Specification:

For each test case, print each of the deepest roots in a line. If such a root is not unique, print them in increasing order of their numbers. In case that the given graph is not a tree, print Error: K components where K