[Python][프로그래머스][Level3] 가장 먼 노드

import queue
def solution(n, edge):
    board=[[] for _ in range(n+1)]
    for x, y in edge:
        board[x].append(y)
        board[y].append(x)
    
    answer=[0]*(n+1)
    q=queue.Queue()
    q.put(1)
    while q.qsize():
        ck=q.get()
        for i in board[ck]:
            if answer[i]==0:
                answer[i]+=answer[ck]+1
                q.put(i)
    
    return answer[2:].count(max(answer[2:]))