R
Ryan Liu
Hi,
I am using TreeNode.NextVisibleNode to loop though all nodes in a tree. I
think this is faster than using recursive algorithm.
But I found this method is not consistent. Sometime it returns right
treeNode, sometime it returns null.
What does "Visible" mean? It is not necessary shown on the form and visible
to our eyes, right?
And form my TreeView, there are multiple first lever nodes(multiple root),
is this a problem? But why it is not consistent?
And even TreeView has multiple root nodes, all those first level nodes are
belong to one parent TreeNode. I just don't want this real root TreeNode
shown on the treeview.
Thanks!
Ryan
I am using TreeNode.NextVisibleNode to loop though all nodes in a tree. I
think this is faster than using recursive algorithm.
But I found this method is not consistent. Sometime it returns right
treeNode, sometime it returns null.
What does "Visible" mean? It is not necessary shown on the form and visible
to our eyes, right?
And form my TreeView, there are multiple first lever nodes(multiple root),
is this a problem? But why it is not consistent?
And even TreeView has multiple root nodes, all those first level nodes are
belong to one parent TreeNode. I just don't want this real root TreeNode
shown on the treeview.
Thanks!
Ryan