Around about you'll find another post from me about TreeViews (TreeView Nodes - Can they be externally instanciated?). I'm almost certain that the problem described therein cannot be solved. Hence I'm using
a different approach....I'm going to use an invisible treeview object as a node store and write functions to check for the existance of a node and to transfer whole nodes to my visible tree.

What I'm asking is, what is the quickest way to traverse a complete node...? Is next / previous quicker than looping through indexes? Would it be better to use 'for each child'?


Anyone out there got any TreeView experience?

Anyone heard of TreeView?



Dan