1195 · 找出树中每行的最大值

1195 · 找出树中每行的最大值

方法1：BFS+层序遍历

public List<Integer> largestValues(TreeNode root) {
    // write your code here
    Queue<TreeNode> q = new LinkedList<>();
    q.offer(root);
    List<Integer> res = new ArrayList<>();
    while (!q.isEmpty()) {
        int size = q.size();
        int maxv = Integer.MIN_VALUE;
        for (int i = 0; i < size; i++) {
            TreeNode cur = q.poll();
            maxv = Math.max(maxv, cur.val);
            if (cur.left != null) q.offer(cur.left);
            if (cur.right != null) q.offer(cur.right);
        }
        res.add(maxv);
    }
    return res;
}