jump to navigation

Tree Traversal April 28, 2006

Posted by Mladen in Algorithm, Article, Coding.
trackback

I have been checking out some information for tree traversal algorithms (hence my previous post) and came upon the following articles. These are all abut the Modified PreOrder Tree Traversal (MPTT) algorithm.

After reading all these (and more) I am starting to understand it and to see how the implementation differs from the Adjacency List algorithm (the one where you have a parent_id on each child and use recursion to read). The biggest difference that there is is the fact that you don't need to use any sort of recursion to read in the data, but the inserting and updating of rows is far more involved using MPTT.

Advertisements

Comments»

No comments yet — be the first.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: