JAVA_Average of Levels in Binary Tree_LeetCode 637


JAVA_Average of Levels in Binary Tree_LeetCode 637

JAVA_Average of Levels in Binary Tree_LeetCode 637 풀이 class Solution { public List<Double> averageOfLevels(TreeNode root) { Queue<TreeNode> q = new LinkedList<>(List.of(root)); List<Double> ans = new ArrayList<>(); while (q.size() > 0) { double len = q.size(), row = 0; for (int i = 0; i < len; i++) { TreeNode curr = q.poll(); row += curr.val; if (curr.left != null) q.offer(curr.left); if (curr.right != null) q.offer(curr.right); } ans.add(row/len); } return ans; } } * 출처 Average of Levels in Bin...


#AverageofLevelsinBinaryTree_LeetCode637 #JAVA #JAVA_AverageofLevelsinBinaryTree #JAVA_AverageofLevelsinBinaryTree_LeetCode637 #JAVA_LeetCode637

원문링크 : JAVA_Average of Levels in Binary Tree_LeetCode 637