LCR 149. 彩灯装饰记录 I

1.leetcode原题链接：. - 力扣（LeetCode）

2.题目描述

一棵圣诞树记作根节点为 root 的二叉树，节点值为该位置装饰彩灯的颜色编号。请按照从 左 到 右 的顺序返回每一层彩灯编号。

示例 1：

输入：root = [8,17,21,18,null,null,6]
输出：[8,17,21,18,6]

3.实现方法

层序遍历

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int[] decorateRecord(TreeNode root) {
        if(root == null){
           return new int[0];
        }
        Queue<TreeNode> queue =new LinkedList<>();
        List<Integer> list =new ArrayList<>();
        queue.offer(root);
        list.add(root.val);
        while(!queue.isEmpty()){
            TreeNode node = queue.poll();
            if(node.left !=null){
                queue.offer(node.left);
                list.add(node.left.val);
            }
            if(node.right !=null){
                queue.offer(node.right);
                list.add(node.right.val);
            }
        }

        int[] res=new int[list.size()];
        for(int i=0;i<list.size();i++){
            res[i]=list.get(i);
        }
        return res;
    }
}