>Hi Terry.
>
>* Or you could pass this routine a reference to your treeview and "crawl"
>* through it in treeview order
>
>< rof,l > and < lol >!!!! Exactly what do you think my code did < s > ?

Hi Marcia.

Sorry I did not realize that (I guess I should not have posted my code:). I did not test your code. I did notice that your code used "VARTYPE" to test for a prospective object. I have not been able to make that work inside treeview. I "have" to use TYPE, otherwise - my methods fail

Also, in your code I could not easily discern how, when it got to the last descendent of a root (which could be several generations deep), crawled back to acquire the next available ancestral (or a great ancestral) sibling.

Also, your code assumes that Node(1) is the root node. Most of the Time this is the case. But, should a project interactively add nodes to a tree in sorted order, the root node may not always be node(1).

Also, I noticed your code does not have a "lastsibling" reference. I could not get my "loop exit" to work properly without a "lastsibling" test. If you can show me how - I would appreciate it.:)

HNY Throb