题目链接：2049. 统计最高分的节点数目
解法如下，使用深度优先搜索遍历这棵树。
from typing import List
class Solution:
def countHighestScoreNodes(self, parents: List[int]) -> int:
n = len(parents)
children = [[] for _ in range(n)]
for node, p in enumerate(parents):
if p != -1:
children[p].append(node)
maxScore, cnt = 0, 0
def dfs(node: int) -> int:
score = 1
size = n - 1
for ch in children[node]:
sz = dfs(ch)
score *= sz
size -= sz
if node != 0:
score *= size
nonlocal maxScore, cnt
if score == maxScore:
cnt += 1
elif score > maxScore:
maxScore, cnt = score, 1
return n - size
dfs(0)
return cnt