Tree -public List<Double> averageOfLevels(TreeNode root) {

edyluisrey · edyluisrey · commit 63c064eb2c4e · 2018-03-11T18:00:13.000-04:00
diff --git a/src/leetcode2018/Trees.java b/src/leetcode2018/Trees.java
@@ -5,8 +5,6 @@
 import java.util.List;
 import java.util.Queue;
 
-import amazon.TreeNode;
-
 
 public class Trees {
 
@@ -146,6 +144,26 @@ public boolean hasPathSum(TreeNode root, int sum) {
 			return  hasPathSum(root.left, sum-root.val) || hasPathSum(root.right,sum-root.val);
 	 }
 	 
+	 public List<Double> averageOfLevels(TreeNode root) {
+	        List<Double> result = new ArrayList<Double>();
+	        if(root==null) return result;
+	        Queue<TreeNode> q = new LinkedList<TreeNode>();
+	        q.offer(root);
+	        while(!q.isEmpty()){
+	            double sum = 0;
+	            int size= q.size();
+	            for(int i =0; i< size; i++){
+	                TreeNode currentNode = q.poll();
+	                sum= sum+ currentNode.val;
+	                if(currentNode.left!=null) q.offer(currentNode.left);
+	                if(currentNode.right!=null) q.offer(currentNode.right);
+	            }
+	            double overage= (double)sum/size; 
+	            result.add(overage);
+	        }
+	        return result;
+	    }
+	 
 }
 
 class TreeNode{
