Python PAT1004 Counting Leaves

 层序遍历

from collections import defaultdict,deque
N,M = map(int,input().split())#
tree = defaultdict(list)
for i in range(M):
    node_id, children, *child_id = input().split()
    tree[node_id] = child_id
que = deque(['01'])
res = []
while que:
    size = len(que)
    num = 0
    for _ in range(size):
        cur = que.popleft()
        if tree[cur]:
            que+=tree[cur]
        else:
            num += 1
    res.append(str(num))
print(" ".join(res))