[leetcode Summary] BFS

ArrayList<String> queue = new ArrayList<String>();
queue.add(root);

while(!queue.isEmpty())
{
        String temp = queue.poll();
        for(neigbor : temp)
        {
               queue.add();
        }
}