<?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/"
		>
<channel>
	<title>Comments on: Working With Recursive Data Part II: Tree Traversal</title>
	<atom:link href="http://www.phpbbdoctor.com/blog/2008/08/02/working-with-recursive-data-part-ii-tree-traversal/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.phpbbdoctor.com/blog/2008/08/02/working-with-recursive-data-part-ii-tree-traversal/</link>
	<description>Your premium source for custom modification services for phpBB</description>
	<lastBuildDate>Mon, 09 Aug 2010 18:09:31 -0500</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Dave Rathbun</title>
		<link>http://www.phpbbdoctor.com/blog/2008/08/02/working-with-recursive-data-part-ii-tree-traversal/comment-page-1/#comment-2930</link>
		<dc:creator>Dave Rathbun</dc:creator>
		<pubDate>Fri, 21 Nov 2008 14:50:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.phpbbdoctor.com/blog/?p=226#comment-2930</guid>
		<description>Hi, Aftab, no... you don&#039;t have to draw it out. :) A tree starts with only a root node. The left and right are 1 and 2. As you add a node to the tree, you determine where it is to be inserted and run a fairly simple insert routine. The insert routine consists of an update statement and an insert statement. The update is to increment the left and right values for all nodes that will be beyond the new node in the tree.

There are other maintenance routines run when you delete a node. Moving a node is a call to the delete and then the insert process, so there is no special code for that.

I will create another blog post to answer this question.</description>
		<content:encoded><![CDATA[<p>Hi, Aftab, no&#8230; you don&#8217;t have to draw it out. <img src='http://www.phpbbdoctor.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />  A tree starts with only a root node. The left and right are 1 and 2. As you add a node to the tree, you determine where it is to be inserted and run a fairly simple insert routine. The insert routine consists of an update statement and an insert statement. The update is to increment the left and right values for all nodes that will be beyond the new node in the tree.</p>
<p>There are other maintenance routines run when you delete a node. Moving a node is a call to the delete and then the insert process, so there is no special code for that.</p>
<p>I will create another blog post to answer this question.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Aftab</title>
		<link>http://www.phpbbdoctor.com/blog/2008/08/02/working-with-recursive-data-part-ii-tree-traversal/comment-page-1/#comment-2929</link>
		<dc:creator>Aftab</dc:creator>
		<pubDate>Fri, 21 Nov 2008 10:40:21 +0000</pubDate>
		<guid isPermaLink="false">http://www.phpbbdoctor.com/blog/?p=226#comment-2929</guid>
		<description>Hi

So to workout the left and right values I have to first draw it out and then run a line around it. How does this work in the real world? Assigning the left and right values in this way just isn&#039;t practical.

Thanks</description>
		<content:encoded><![CDATA[<p>Hi</p>
<p>So to workout the left and right values I have to first draw it out and then run a line around it. How does this work in the real world? Assigning the left and right values in this way just isn&#8217;t practical.</p>
<p>Thanks</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dave Rathbun</title>
		<link>http://www.phpbbdoctor.com/blog/2008/08/02/working-with-recursive-data-part-ii-tree-traversal/comment-page-1/#comment-2705</link>
		<dc:creator>Dave Rathbun</dc:creator>
		<pubDate>Sat, 02 Aug 2008 20:52:25 +0000</pubDate>
		<guid isPermaLink="false">http://www.phpbbdoctor.com/blog/?p=226#comment-2705</guid>
		<description>Hi, Micheal, it seems we&#039;re both making the &quot;blog rounds&quot; today. :lol:

The next post I&#039;m working on in this series is going to show (in pseudo-code) how I manage the tree structure. I have functions called add_node() and delete_node() and move_node() and so on. By setting up these functions it becomes very easy to manage the tree data. No doubt there is something very similar in phpBB3.</description>
		<content:encoded><![CDATA[<p>Hi, Micheal, it seems we&#8217;re both making the &#8220;blog rounds&#8221; today. <img src='http://www.phpbbdoctor.com/blog/wp-includes/images/smilies/icon_lol.gif' alt=':lol:' class='wp-smiley' /> </p>
<p>The next post I&#8217;m working on in this series is going to show (in pseudo-code) how I manage the tree structure. I have functions called add_node() and delete_node() and move_node() and so on. By setting up these functions it becomes very easy to manage the tree data. No doubt there is something very similar in phpBB3.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Micheal</title>
		<link>http://www.phpbbdoctor.com/blog/2008/08/02/working-with-recursive-data-part-ii-tree-traversal/comment-page-1/#comment-2704</link>
		<dc:creator>Micheal</dc:creator>
		<pubDate>Sat, 02 Aug 2008 20:36:42 +0000</pubDate>
		<guid isPermaLink="false">http://www.phpbbdoctor.com/blog/?p=226#comment-2704</guid>
		<description>My brain hurts. :P Funnily enough, I may just have to make use of this in one of my projects. Not looking forward to it. At least now I get why phpBB3 does this. :)</description>
		<content:encoded><![CDATA[<p>My brain hurts. <img src='http://www.phpbbdoctor.com/blog/wp-includes/images/smilies/icon_razz.gif' alt=':P' class='wp-smiley' />  Funnily enough, I may just have to make use of this in one of my projects. Not looking forward to it. At least now I get why phpBB3 does this. <img src='http://www.phpbbdoctor.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
</channel>
</rss>
