52 lines
1.5 KiB
Markdown
52 lines
1.5 KiB
Markdown
|
<p>给你二叉树的根节点 <code>root</code> ，返回它节点值的 <strong>前序</strong><em> </em>遍历。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/inorder_1.jpg" style="width: 202px; height: 324px;" />
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>root = [1,null,2,3]
|
|||
|
|
<strong>输出：</strong>[1,2,3]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>root = []
|
|||
|
|
<strong>输出：</strong>[]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>root = [1]
|
|||
|
|
<strong>输出：</strong>[1]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 4：</strong></p>
|
|||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/inorder_5.jpg" style="width: 202px; height: 202px;" />
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>root = [1,2]
|
|||
|
|
<strong>输出：</strong>[1,2]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 5：</strong></p>
|
|||
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/09/15/inorder_4.jpg" style="width: 202px; height: 202px;" />
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>root = [1,null,2]
|
|||
|
|
<strong>输出：</strong>[1,2]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>树中节点数目在范围 <code>[0, 100]</code> 内</li>
|
|||
|
|
<li><code>-100 <= Node.val <= 100</code></li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>进阶：</strong>递归算法很简单，你可以通过迭代算法完成吗？</p>
|
|||
|
|
<div><div>Related Topics</div><div><li>栈</li><li>树</li></div></div>\n<div><li>👍 552</li><li>👎 0</li></div>
|