23 lines
553 B
Markdown
23 lines
553 B
Markdown
|
<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],
|
||
|
|
[20,9],
|
||
|
|
[15,7]
|
||
|
|
]
|
||
|
|
</pre>
|
||
|
|
<div><div>Related Topics</div><div><li>栈</li><li>树</li><li>广度优先搜索</li></div></div>\n<div><li>👍 421</li><li>👎 0</li></div>
|