Hi Kevin But you state that you are not a programmer, so we need to know a bit more, especially what kind of representation do you have for your "btree". Whether the tree is balanced or not is not really of any importance to the output algorithm, the real issue is whether or not your data is stored in an elegant representation. Also if your data turns out not to be, it may even be worth transforming it. Hopefully you have a relational database at least. If you do, then give us the database structure, this group is pretty slick with database queries. Meantime here is some background reading. http://www.sitepoint.com/article/hierarchical-data-database/ HTH Keith
KevinS wrote: > i, > I'll start by saying I'm not a programmer, just someone who dabbles > from time to time (and have since assembly on a 6502...). > > My current 'exercise' has hit a bit of a wall. I wish to display a > btree type load of data (actually a genealogy pedigree which I already > have loaded in a database) in the following type layout: > > +--James Trethewy > +--Richard Trethewy > | +--Mary Williams > Robert Trethewy > | +--William Hawkins > +--Joan Hawkins > > I can find all sorts of algorithms for outputting btrees, but not in > this form. It would be easy if I knew it was a balanced tree and how > many levels it was, but such things aren't to be. > > Does anyone have anything that will do this? If not, pointers to some > code (any language will do), or some reading I should be attending to? > > Cheers > Kevin > > > > > --~--~---------~--~----~------------~-------~--~----~ NZ PHP Users Group: http://groups.google.com/group/nzphpug To post, send email to [email protected] To unsubscribe, send email to [email protected] -~----------~----~----~----~------~----~------~--~---
