cong-shang-dao-xia-da-yin-er-cha-shu-lcof

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

English description is not available for the problem. Please switch to Chinese.

decorateRecord

彩灯装饰记录 I

Tree

Breadth-First Search

Binary Tree

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

&nbsp;

示例 1：

<img alt="" src="https://pic.leetcode.cn/1694758674-XYrUiV-%E5%89%91%E6%8C%87%20Offer%2032%20-%20I_%E7%A4%BA%E4%BE%8B1.png" />

<pre>
输入：root = [8,17,21,18,null,null,6]
输出：[8,17,21,18,6]
</pre>

&nbsp;

提示：

<ol>
	<li><code>节点总数 &lt;= 1000</code></li>
</ol>

&nbsp;