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
| class Solution { public List<Double> averageOfLevels(TreeNode root) { List<Double> resultList = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<>(); queue.offer(root); while (!queue.isEmpty()) { double sum = 0; double size = queue.size(); for (int i = queue.size(); i > 0; i--) { TreeNode node = queue.poll(); sum += node.val; if (node.left != null) { queue.offer(node.left); } if (node.right != null) { queue.offer(node.right); } }
resultList.add(sum / size); }
return resultList; } }
|
注意潜在的整数越界问题。
References
637. Average of Levels in Binary Tree