Jeff Chastain wrote: > > I am trying to remember my old CS days, but the memory is going. I need to > simulate a tree with n-nodes per branch ... i.e. a nested folder structure > with 0 to n objects in each folder. The folders can be nested infinitely > deep. So, what is the algorithm for traversing this type of tree? > > Most everything I have found thus far is for building binary trees ... i.e. > a given node only has two children. I need n children per node. One > article said that any type of tree can be represented as a binary tree, but > I am failing to see that. > > Any suggestions or pointers?
Pick up a copy of Joe Celko's "SQL for Smarties". He might look like Ming the Merciless, but he's bloody good. The book goes into a lot of detail about representing hierarchies in RDBMSs. And even if you can't justify it for that alone, there's lots of other stuff covered in it. Take a peek on Amazon. K. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~| Logware (www.logware.us): a new and convenient web-based time tracking application. Start tracking and documenting hours spent on a project or with a client with Logware today. Try it for free with a 15 day trial account. http://www.houseoffusion.com/banners/view.cfm?bannerid=67 Message: http://www.houseoffusion.com/lists.cfm/link=i:4:194715 Archives: http://www.houseoffusion.com/cf_lists/threads.cfm/4 Subscription: http://www.houseoffusion.com/lists.cfm/link=s:4 Unsubscribe: http://www.houseoffusion.com/cf_lists/unsubscribe.cfm?user=89.70.4 Donations & Support: http://www.houseoffusion.com/tiny.cfm/54
