Thanks to Matthew and Denis for trying to enlighten me. Thanks to your
clues I've made some progress; however, I can't seem to get the hang of
the usual recursion trick of keeping track of the level one is on. It
doesn't work, I suppose, because the data structure I'm traversing isn't
actually
Matthew,
sorry for responding to you instead of the list
Thanks for trying to tutor the dunderheaded. It is exactly the general
solution I wish to learn. But how, in the context of my treeTraversal
function, does one "keep track of the depth you're at"? Tabs are all very
well, but what I want
All,
any observations might be helpful. For the display of database contents I
have the following problem:
Database querys will return data to me in tuples of the following sort:
each tuple has a unique id, a parent id, and a type.
a parent id of 0 indicates that the element has no parent.
no
