Commit 2a7c960

committed

Add Solution.java to problems 0637

1 parent 74c5a33 commit 2a7c960Copy full SHA for 2a7c960

File tree

+35

-0

lines changed

solution
- 0637. Average of Levels in Binary Tree
  - Solution.java
- 0671. Second Minimum Node In a Binary Tree
  - Solution.java

+35

-0

lines changed

Lines changed: 35 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,35 @@`
	`1`	`+/**`
	`2`	`+ * Definition for a binary tree node.`
	`3`	`+ * public class TreeNode {`
	`4`	`+ * int val;`
	`5`	`+ * TreeNode left;`
	`6`	`+ * TreeNode right;`
	`7`	`+ * TreeNode(int x) { val = x; }`
	`8`	`+ * }`
	`9`	`+ */`
	`10`	`+class Solution {`
	`11`	`+`
	`12`	`+ public List<Double> averageOfLevels(TreeNode root) {`
	`13`	`+ if (root == null) return null;`
	`14`	`+`
	`15`	`+ List<Double> res = new ArrayList<>();`
	`16`	`+ LinkedList<TreeNode> queue = new LinkedList<>();`
	`17`	`+ queue.offer(root);`
	`18`	`+`
	`19`	`+ while (!queue.isEmpty()) {`
	`20`	`+ double sum = 0, size = queue.size();`
	`21`	`+ for (int i = 0; i < size; i ++) {`
	`22`	`+ TreeNode node = queue.poll();`
	`23`	`+ sum += node.val;`
	`24`	`+ if (node.left != null) {`
	`25`	`+ queue.offer(node.left);`
	`26`	`+ }`
	`27`	`+ if (node.right != null) {`
	`28`	`+ queue.offer(node.right);`
	`29`	`+ }`
	`30`	`+ }`
	`31`	`+ res.add(sum / size);`
	`32`	`+ }`
	`33`	`+ return res;`
	`34`	`+ }`
	`35`	`+}`

File renamed without changes.

Comments

(0)