<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Binary Tree Traversal: Breadth First aka Width First aka Level Order</title>
	<atom:link href="http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/feed/" rel="self" type="application/rss+xml" />
	<link>http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/</link>
	<description>The largest pool of technical questions with answers, explantions, code and detailed analysis</description>
	<lastBuildDate>Tue, 17 Nov 2009 16:28:09 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Jose</title>
		<link>http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-9559</link>
		<dc:creator>Jose</dc:creator>
		<pubDate>Wed, 07 Jan 2009 03:58:49 +0000</pubDate>
		<guid isPermaLink="false">http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-9559</guid>
		<description>23lruxtTKcZps</description>
		<content:encoded><![CDATA[<p>23lruxtTKcZps</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: JustCurious</title>
		<link>http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-9545</link>
		<dc:creator>JustCurious</dc:creator>
		<pubDate>Sun, 16 Nov 2008 05:41:14 +0000</pubDate>
		<guid isPermaLink="false">http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-9545</guid>
		<description>I&#039;m currently working on an assignment that require us
to construct a binary tree from a given postorder and inorder sequence. I just finished the mechanism, and now I&#039;m trying
to use level order traversal to print the tree on the screen.
Though the queue method is rather straight forward, I&#039;m 
wondering if it is possible to travel through a tree without
the use of a queue(while the tree being a linked list)? I didn&#039;t find anything on the net. Any ideas??</description>
		<content:encoded><![CDATA[<p>I&#8217;m currently working on an assignment that require us<br />
to construct a binary tree from a given postorder and inorder sequence. I just finished the mechanism, and now I&#8217;m trying<br />
to use level order traversal to print the tree on the screen.<br />
Though the queue method is rather straight forward, I&#8217;m<br />
wondering if it is possible to travel through a tree without<br />
the use of a queue(while the tree being a linked list)? I didn&#8217;t find anything on the net. Any ideas??</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nitin</title>
		<link>http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-9509</link>
		<dc:creator>Nitin</dc:creator>
		<pubDate>Fri, 11 Jul 2008 12:15:38 +0000</pubDate>
		<guid isPermaLink="false">http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-9509</guid>
		<description>Awsome explaination! Thanks.</description>
		<content:encoded><![CDATA[<p>Awsome explaination! Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Breadth-First Binary Tree Traversal &#124; xAbhishek.com</title>
		<link>http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-9500</link>
		<dc:creator>Breadth-First Binary Tree Traversal &#124; xAbhishek.com</dc:creator>
		<pubDate>Wed, 23 Apr 2008 09:55:57 +0000</pubDate>
		<guid isPermaLink="false">http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-9500</guid>
		<description>[...] This explanation is excellent. [...]</description>
		<content:encoded><![CDATA[<p>[...] This explanation is excellent. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: uerchelle</title>
		<link>http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-7431</link>
		<dc:creator>uerchelle</dc:creator>
		<pubDate>Wed, 28 Nov 2007 16:18:35 +0000</pubDate>
		<guid isPermaLink="false">http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-7431</guid>
		<description>so how do u actually output  the width of  the tree, for example the question write a function to find the maximum width of a binary tree</description>
		<content:encoded><![CDATA[<p>so how do u actually output  the width of  the tree, for example the question write a function to find the maximum width of a binary tree</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John</title>
		<link>http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-5043</link>
		<dc:creator>John</dc:creator>
		<pubDate>Fri, 28 Sep 2007 10:41:33 +0000</pubDate>
		<guid isPermaLink="false">http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-5043</guid>
		<description>My professor was asking us to show a step by step of this. I knew what a level order traversal was, but I could not figure out how he wanted us to show him. Missed a few classes and started it the last minute. This was a life saver.</description>
		<content:encoded><![CDATA[<p>My professor was asking us to show a step by step of this. I knew what a level order traversal was, but I could not figure out how he wanted us to show him. Missed a few classes and started it the last minute. This was a life saver.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sri</title>
		<link>http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-4493</link>
		<dc:creator>Sri</dc:creator>
		<pubDate>Wed, 12 Sep 2007 00:48:10 +0000</pubDate>
		<guid isPermaLink="false">http://tekpool.wordpress.com/2006/11/04/binary-tree-traversal-breadth-first-aka-width-first-aka-level-order/#comment-4493</guid>
		<description>Thanks.</description>
		<content:encoded><![CDATA[<p>Thanks.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
