mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
27 lines
412 B
HTML
27 lines
412 B
HTML
|
<p>从上到下打印出二叉树的每个节点，同一层的节点按照从左到右的顺序打印。</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
|
||
|
|
<p>例如:<br>
|
||
|
|
给定二叉树: <code>[3,9,20,null,null,15,7]</code>,</p>
|
||
|
|
|
||
|
|
<pre> 3
|
||
|
|
/ \
|
||
|
|
9 20
|
||
|
|
/ \
|
||
|
|
15 7
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p>返回：</p>
|
||
|
|
|
||
|
|
<pre>[3,9,20,15,7]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
|
||
|
|
<p><strong>提示：</strong></p>
|
||
|
|
|
||
|
|
<ol>
|
||
|
|
<li><code>节点总数 <= 1000</code></li>
|
||
|
|
</ol>
|