Leetcode学习笔记：#637. Average of Levels in Binary Tree

Leetcode学习笔记：#637. Average of Levels in Binary Tree

Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.、

实现：

public List<Double> averageOfLevels(TreeNode root)[
	List<Double> result = new ArrayList<>();
	Queue<TreeNode> q = new LinkedList<>();

	if(root == null) return result;
	q.add(root);
	while(!q.empty()){
		int n = q.size();
		double sum = 0.0;
		for(int i = 0; i < n; i++){
			TreeNode node = q.poll();
			sum += node.val;
			if(node.left != null) q.offer(node.left);
			if(node.right != null) q.offer(node.right);
		}
		result.add(sum / n);
	}
	return result;
}

思路：
BFS，leves问题都可以用BFS队列解答。一个队列保存层数的所有节点，遍历该层节点并把值加入sum，再把该层节点的子节点加入queue中，进入下次循环。