Helo Doug, On Wed, 25 Jul 2007, Doug Plant wrote:
> Is there any value in facilitating, in some way, different types of > trees? > > It seems to me that once you're talking about searching a tree, you're > only a big dataset away from wanting to consider a balanced tree of > some kind. The design allows for whatever method of storing trees you want. As most likely the data will be stored in a database, I am not sure how binairy trees in all their variants would work here. It is also useful to have a memory representation of a tree structure, and perhaps there it makes sense however, hash lookups on the node's ID are probably going to be much faster than balanced trees. Even more because the component actually deals with a user-defined structure, and not just a data structure containing data like most of the balanced trees implement. regards, Derick -- Components mailing list [email protected] http://lists.ez.no/mailman/listinfo/components
