Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**
- * Definition for a binary tree node.
- * public class TreeNode {
- * int val;
- * TreeNode left;
- * TreeNode right;
- * TreeNode() {}
- * TreeNode(int val) { this.val = val; }
- * TreeNode(int val, TreeNode left, TreeNode right) {
- * this.val = val;
- * this.left = left;
- * this.right = right;
- * }
- * }
- */
- class Solution {
- public List<Double> averageOfLevels(TreeNode root) {
- Queue<TreeNode>queue = new LinkedList<>();
- List<Double> list = new ArrayList<>();
- int count = 0;
- double sum = 0;
- if (root == null) {
- return null;
- }
- queue.add(root);
- while(!queue.isEmpty()){
- int numberOfNodes = queue.size();
- while(numberOfNodes>0){
- TreeNode presentNode = queue.remove();
- sum+=presentNode.val;
- count++;
- if(presentNode.left!=null){
- queue.add(presentNode.left);
- }
- if(presentNode.right!=null){
- queue.add(presentNode.right);
- }
- numberOfNodes--;
- }
- list.add(sum/count);
- sum = 0;
- count = 0;
- }
- return list;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement