<?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>Binary Tree Archives - Web Rewrite</title>
	<atom:link href="https://webrewrite.com/tag/binary-tree/feed/" rel="self" type="application/rss+xml" />
	<link></link>
	<description>Technology Blog Where You Find Programming Tips and Tricks</description>
	<lastBuildDate>Thu, 17 Mar 2022 02:21:28 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.0.7</generator>
	<item>
		<title>Binary Tree Postorder Traversal without Recursion</title>
		<link>https://webrewrite.com/binary-tree-postorder-traversal-without-recursion/</link>
					<comments>https://webrewrite.com/binary-tree-postorder-traversal-without-recursion/#disqus_thread</comments>
		
		<dc:creator><![CDATA[WebRewrite]]></dc:creator>
		<pubDate>Thu, 17 Mar 2022 01:52:59 +0000</pubDate>
				<category><![CDATA[Binary Tree]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[Recursion]]></category>
		<guid isPermaLink="false">https://webrewrite.com/?p=3935</guid>

					<description><![CDATA[<p>&#160;In this tutorial, I am going to discuss binary tree&#160;postorder traversal. How to implement binary tree postorder traversal with and without recursion. Given the root&#8230;</p>
<p>The post <a href="https://webrewrite.com/binary-tree-postorder-traversal-without-recursion/">Binary Tree Postorder Traversal without Recursion</a> appeared first on <a href="https://webrewrite.com">Web Rewrite</a>.</p>
]]></description>
		
					<wfw:commentRss>https://webrewrite.com/binary-tree-postorder-traversal-without-recursion/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Serialize and Deserialize Binary Tree</title>
		<link>https://webrewrite.com/serialize-and-deserialize-binary-tree/</link>
					<comments>https://webrewrite.com/serialize-and-deserialize-binary-tree/#disqus_thread</comments>
		
		<dc:creator><![CDATA[WebRewrite]]></dc:creator>
		<pubDate>Fri, 11 Mar 2022 02:42:09 +0000</pubDate>
				<category><![CDATA[Binary Tree]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[Serialize and Deserialize Binary Tree]]></category>
		<guid isPermaLink="false">https://webrewrite.com/?p=3722</guid>

					<description><![CDATA[<p>Given a binary tree, write a code to serialize and deserialize binary tree. You can choose any algorithm for serialization and deserialization of a binary&#8230;</p>
<p>The post <a href="https://webrewrite.com/serialize-and-deserialize-binary-tree/">Serialize and Deserialize Binary Tree</a> appeared first on <a href="https://webrewrite.com">Web Rewrite</a>.</p>
]]></description>
		
					<wfw:commentRss>https://webrewrite.com/serialize-and-deserialize-binary-tree/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Binary Tree Preorder Traversal</title>
		<link>https://webrewrite.com/binary-tree-preorder-traversal/</link>
					<comments>https://webrewrite.com/binary-tree-preorder-traversal/#disqus_thread</comments>
		
		<dc:creator><![CDATA[WebRewrite]]></dc:creator>
		<pubDate>Sun, 28 Mar 2021 12:54:19 +0000</pubDate>
				<category><![CDATA[Binary Tree]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[Binary Tree Preorder Traversal without Recursion]]></category>
		<category><![CDATA[Preorder Traversal]]></category>
		<guid isPermaLink="false">https://webrewrite.com/?p=3773</guid>

					<description><![CDATA[<p>In this tutorial, i am going to discuss what is binary tree preorder traversal? How to implement binary tree preorder traversal with and without recursion.&#8230;</p>
<p>The post <a href="https://webrewrite.com/binary-tree-preorder-traversal/">Binary Tree Preorder Traversal</a> appeared first on <a href="https://webrewrite.com">Web Rewrite</a>.</p>
]]></description>
		
					<wfw:commentRss>https://webrewrite.com/binary-tree-preorder-traversal/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Validate Binary Search Tree &#124; Binary Tree is BST or Not</title>
		<link>https://webrewrite.com/validate-binary-search-tree-binary-tree-is-bst-or-not/</link>
					<comments>https://webrewrite.com/validate-binary-search-tree-binary-tree-is-bst-or-not/#disqus_thread</comments>
		
		<dc:creator><![CDATA[WebRewrite]]></dc:creator>
		<pubDate>Sat, 27 Feb 2021 08:52:45 +0000</pubDate>
				<category><![CDATA[Binary Search Tree]]></category>
		<category><![CDATA[Binary Tree]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[programming]]></category>
		<guid isPermaLink="false">https://webrewrite.com/?p=3756</guid>

					<description><![CDATA[<p>In this post, I am going to discuss a very famous interview problem validate binary search tree or in other words check if a binary&#8230;</p>
<p>The post <a href="https://webrewrite.com/validate-binary-search-tree-binary-tree-is-bst-or-not/">Validate Binary Search Tree | Binary Tree is BST or Not</a> appeared first on <a href="https://webrewrite.com">Web Rewrite</a>.</p>
]]></description>
		
					<wfw:commentRss>https://webrewrite.com/validate-binary-search-tree-binary-tree-is-bst-or-not/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Construct Binary Search Tree from Preorder Traversal</title>
		<link>https://webrewrite.com/construct-binary-search-tree-from-preorder-traversal/</link>
					<comments>https://webrewrite.com/construct-binary-search-tree-from-preorder-traversal/#disqus_thread</comments>
		
		<dc:creator><![CDATA[WebRewrite]]></dc:creator>
		<pubDate>Wed, 07 Oct 2020 05:46:25 +0000</pubDate>
				<category><![CDATA[Binary Tree]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[Construct Binary Search Tree from Preorder Traversal]]></category>
		<guid isPermaLink="false">https://webrewrite.com/?p=3608</guid>

					<description><![CDATA[<p>Construct Binary Search Tree from Preorder Traversal. Given the preorder traversal of a binary tree. We have to write a code to return the root&#8230;</p>
<p>The post <a href="https://webrewrite.com/construct-binary-search-tree-from-preorder-traversal/">Construct Binary Search Tree from Preorder Traversal</a> appeared first on <a href="https://webrewrite.com">Web Rewrite</a>.</p>
]]></description>
		
					<wfw:commentRss>https://webrewrite.com/construct-binary-search-tree-from-preorder-traversal/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Binary Tree Level Order Traversal II</title>
		<link>https://webrewrite.com/binary-tree-level-order-traversal-ii/</link>
					<comments>https://webrewrite.com/binary-tree-level-order-traversal-ii/#disqus_thread</comments>
		
		<dc:creator><![CDATA[WebRewrite]]></dc:creator>
		<pubDate>Sun, 04 Oct 2020 05:49:43 +0000</pubDate>
				<category><![CDATA[Binary Tree]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[Binary Tree Level Order Traversal II]]></category>
		<guid isPermaLink="false">https://webrewrite.com/?p=3444</guid>

					<description><![CDATA[<p>Binary Tree Level Order Traversal II. Given a binary tree, return the bottom-up level order traversal of its node&#8217;s values.  (ie, from left to right,&#8230;</p>
<p>The post <a href="https://webrewrite.com/binary-tree-level-order-traversal-ii/">Binary Tree Level Order Traversal II</a> appeared first on <a href="https://webrewrite.com">Web Rewrite</a>.</p>
]]></description>
		
					<wfw:commentRss>https://webrewrite.com/binary-tree-level-order-traversal-ii/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Binary Tree Zigzag Level Order Traversal</title>
		<link>https://webrewrite.com/binary-tree-zigzag-level-order-traversal/</link>
					<comments>https://webrewrite.com/binary-tree-zigzag-level-order-traversal/#disqus_thread</comments>
		
		<dc:creator><![CDATA[WebRewrite]]></dc:creator>
		<pubDate>Wed, 22 Jul 2020 13:39:07 +0000</pubDate>
				<category><![CDATA[Binary Tree]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[Binary Tree Zigzag Level Order Traversal]]></category>
		<guid isPermaLink="false">https://webrewrite.com/?p=3468</guid>

					<description><![CDATA[<p>Given a binary Tree, write a code to return binary tree zigzag level order traversal of its node&#8217;s values. (ie, from left to right, then&#8230;</p>
<p>The post <a href="https://webrewrite.com/binary-tree-zigzag-level-order-traversal/">Binary Tree Zigzag Level Order Traversal</a> appeared first on <a href="https://webrewrite.com">Web Rewrite</a>.</p>
]]></description>
		
					<wfw:commentRss>https://webrewrite.com/binary-tree-zigzag-level-order-traversal/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Invert Binary Tree</title>
		<link>https://webrewrite.com/invert-binary-tree/</link>
					<comments>https://webrewrite.com/invert-binary-tree/#disqus_thread</comments>
		
		<dc:creator><![CDATA[WebRewrite]]></dc:creator>
		<pubDate>Thu, 04 Jun 2020 03:40:10 +0000</pubDate>
				<category><![CDATA[Binary Tree]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[LeetCode]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[Invert Binary Tree]]></category>
		<category><![CDATA[Recursion]]></category>
		<guid isPermaLink="false">https://webrewrite.com/?p=3364</guid>

					<description><![CDATA[<p>How to Invert Binary Tree or How to convert a binary tree into its mirror tree. Given a binary tree, we have to write a&#8230;</p>
<p>The post <a href="https://webrewrite.com/invert-binary-tree/">Invert Binary Tree</a> appeared first on <a href="https://webrewrite.com">Web Rewrite</a>.</p>
]]></description>
		
					<wfw:commentRss>https://webrewrite.com/invert-binary-tree/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
