<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>iteration Archives - Huahua&#039;s Tech Road</title>
	<atom:link href="https://zxi.mytechroad.com/blog/tag/iteration/feed/" rel="self" type="application/rss+xml" />
	<link>https://zxi.mytechroad.com/blog/tag/iteration/</link>
	<description></description>
	<lastBuildDate>Thu, 30 Jan 2020 01:34:53 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.0.8</generator>

<image>
	<url>https://zxi.mytechroad.com/blog/wp-content/uploads/2017/09/cropped-photo-32x32.jpg</url>
	<title>iteration Archives - Huahua&#039;s Tech Road</title>
	<link>https://zxi.mytechroad.com/blog/tag/iteration/</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>花花酱 LeetCode 144. Binary Tree Preorder Traversal</title>
		<link>https://zxi.mytechroad.com/blog/tree/leetcode-144-binary-tree-preorder-traversal/</link>
					<comments>https://zxi.mytechroad.com/blog/tree/leetcode-144-binary-tree-preorder-traversal/#respond</comments>
		
		<dc:creator><![CDATA[zxi]]></dc:creator>
		<pubDate>Thu, 30 Jan 2020 01:34:46 +0000</pubDate>
				<category><![CDATA[Tree]]></category>
		<category><![CDATA[easy]]></category>
		<category><![CDATA[iteration]]></category>
		<category><![CDATA[O(n)]]></category>
		<category><![CDATA[recursion]]></category>
		<category><![CDATA[stack]]></category>
		<category><![CDATA[traversal]]></category>
		<category><![CDATA[tree]]></category>
		<guid isPermaLink="false">https://zxi.mytechroad.com/blog/?p=6165</guid>

					<description><![CDATA[<p>Given a binary tree, return the&#160;preorder&#160;traversal of its nodes&#8217; values. Example: Input:&#160;[1,null,2,3] 1 \ 2 / 3 Output:&#160;[1,2,3] Follow up:&#160;Recursive solution is trivial, could you&#8230;</p>
<p>The post <a rel="nofollow" href="https://zxi.mytechroad.com/blog/tree/leetcode-144-binary-tree-preorder-traversal/">花花酱 LeetCode 144. Binary Tree Preorder Traversal</a> appeared first on <a rel="nofollow" href="https://zxi.mytechroad.com/blog">Huahua&#039;s Tech Road</a>.</p>
]]></description>
										<content:encoded><![CDATA[
<p>Given a binary tree, return the&nbsp;<em>preorder</em>&nbsp;traversal of its nodes&#8217; values.</p>



<p><strong>Example:</strong></p>



<pre class="wp-block-preformatted;crayon:false"><strong>Input:</strong>&nbsp;<code>[1,null,2,3]</code>
   1
    \
     2
    /
   3

<strong>Output:</strong>&nbsp;<code>[1,2,3]</code>
</pre>



<p><strong>Follow up:</strong>&nbsp;Recursive solution is trivial, could you do it iteratively?</p>



<h2><strong>Solution 1: Recursion</strong></h2>



<p>Time complexity: O(n)<br>Space complexity: O(n)</p>



<div class="responsive-tabs">
<h2 class="tabtitle">C++</h2>
<div class="tabcontent">

<pre class="crayon-plain-tag">// Author: Huahua
class Solution {
public:
  vector&lt;int&gt; preorderTraversal(TreeNode* root) {
    vector&lt;int&gt; ans;    
    function&lt;void(TreeNode*)&gt; preorder = [&amp;](TreeNode* n) {
      if (!n) return;
      ans.push_back(n-&gt;val);
      preorder(n-&gt;left);
      preorder(n-&gt;right);
    };
    preorder(root);
    return ans;
  }
};</pre>
</div></div>



<h2><strong>Solution 2: Stack</strong></h2>



<p>Time complexity: O(n)<br>Space complexity: O(n)</p>



<div class="responsive-tabs">
<h2 class="tabtitle">C++</h2>
<div class="tabcontent">

<pre class="crayon-plain-tag">// Author: Huahua
class Solution {
public:
  vector&lt;int&gt; preorderTraversal(TreeNode* root) {
    vector&lt;int&gt; ans;
    stack&lt;TreeNode*&gt; s;
    if (root) s.push(root);
    while (!s.empty()) {
      TreeNode* n = s.top();
      ans.push_back(n-&gt;val);
      s.pop();
      if (n-&gt;right) s.push(n-&gt;right);
      if (n-&gt;left) s.push(n-&gt;left);            
    }
    return ans;
  }</pre>
</div></div>


<p>The post <a rel="nofollow" href="https://zxi.mytechroad.com/blog/tree/leetcode-144-binary-tree-preorder-traversal/">花花酱 LeetCode 144. Binary Tree Preorder Traversal</a> appeared first on <a rel="nofollow" href="https://zxi.mytechroad.com/blog">Huahua&#039;s Tech Road</a>.</p>
]]></content:encoded>
					
					<wfw:commentRss>https://zxi.mytechroad.com/blog/tree/leetcode-144-binary-tree-preorder-traversal/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
