题目![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/c9447d0b0582dd4c937ab4c7e440892f.png)
代码
class Solution {
public List<Integer> largestValues(TreeNode root) {
List<Integer> res = new LinkedList<>();
if (null == root) return res;
LinkedList<TreeNode> queue = new LinkedList<>();
queue.add(root);
while (!queue.isEmpty()) {
int size = queue.size();
int max = queue.getFirst().val;
for (int i = 0; i < size; i++) {
TreeNode node = queue.removeFirst();
if (node.val > max) max = node.val;
if (node.left != null) queue.addLast(node.left);
if (node.right != null) queue.addLast(node.right);
}res.add(max);
}return res;
}
}
结果
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/e8aae328e125f8fe1a3dbe0b6747a978.png)