leetcode/Problem637/Solution.java at master · gorthitk/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39


import java.util.*;

public class Solution
{
    public List<Double> averageOfLevels(TreeNode root)
    {
        List<Double> avergaes = new ArrayList<Double>();
        if (root != null)
        {
            Queue<TreeNode> queue = new LinkedList<>();
            queue.add(root);
            while (!queue.isEmpty())
            {
                int count = 0;
                double sum = 0;
                Queue<TreeNode> nextLevel = new LinkedList<>();
                while (!queue.isEmpty())
                {
                    TreeNode node = queue.poll();
                    count++;
                    sum += node.val;
                    if (node.left != null)
                    {
                        nextLevel.add(node.left);
                    }
                    if (node.right != null)
                    {
                        nextLevel.add(node.right);
                    }
                }
                avergaes.add(sum / count);
                queue = nextLevel;
            }
        }
        return avergaes;
    }
}