You need to find the largest value in each row of a binary tree.
Example:
Input: 1 / \ 3 2 / \ \ 5 3 9 Output: [1, 3, 9]
Subscribe to see which companies asked this question.
Solution:
Tips:
Level traversal
Java Code:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public List<Integer> largestValues(TreeNode root) {
List<Integer> result = new ArrayList<>();
if (null == root) {
return result;
}
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
int currentLevelCnt = 1;
while (!queue.isEmpty()) {
TreeNode node = queue.poll();
int maxVal = node.val;
int cnt = 0;
if (node.left != null) {
queue.add(node.left);
cnt++;
}
if (node.right != null) {
queue.add(node.right);
cnt++;
}
for (int i = 1; i < currentLevelCnt; i++) {
node = queue.poll();
if (node.left != null) {
queue.add(node.left);
cnt++;
}
if (node.right != null) {
queue.add(node.right);
cnt++;
}
maxVal = Math.max(maxVal, node.val);
}
currentLevelCnt = cnt;
result.add(maxVal);
}
return result;
}
}