-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBTAverageLevel.java
More file actions
51 lines (33 loc) · 1.19 KB
/
BTAverageLevel.java
File metadata and controls
51 lines (33 loc) · 1.19 KB
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
40
41
42
43
44
45
46
47
48
49
50
51
package com.vinay.practice.lc;
// https://leetcode.com/problems/average-of-levels-in-binary-tree/
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import com.vinay.practice.lc.BTLevelOrder.TreeNode;
public class BTAverageLevel {
public List<Double> averageOfLevels(TreeNode root) {
List<Double> averageList = new ArrayList<Double>();
if(root == null)
return averageList;
Queue<TreeNode> queueList = new LinkedList<>();
queueList.offer(root);
while(!queueList.isEmpty()) {
int levelSize = queueList.size();
Double average = 0.0;
for(int i=0; i<levelSize; i++){
TreeNode node = queueList.poll();
average += node.val;
if(node.left != null){
queueList.offer(node.left);
}
if(node.right != null){
queueList.offer(node.right);
}
}
average = average / levelSize;
averageList.add(average);
}
return averageList;
}
}