第一题ac了,根据输入来构建树,然后求根节点子树的最大节点个数 class TreeNode(): def __init__(self, val): self.val = val self.next = [] N = int(input()) edgelist = [] for i in range(N-1): edgelist.append(list(map(int, input().split()))) Nodelist = [] for i in range(1,N+1): Nodelist.append(TreeNode(i))...