Click here to Skip to main content
15,936,887 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
i have a root node and its childs,childs node also contains child,and their child also contain childs,can any one tell me how to find this through recursively because it will check child's of child till end, and simaltanously add them to treeview,

e.g:
i have root 1
1---
2---4
.---5---6
. ---7
3

i am searching for childs of child through a particular id and it stop the searcgubg when it gets 0 parent id.
thanks in advance
Posted

You can do it recursively, something like this:
C#
void getChildren() {
   System.Console.WriteLine(this.ToString());
   foreach(child Node in Nodes) {
      child.getChildren();
   } 
}

Good luck!
 
Share this answer
 
I suppose something like this should work (pseudo-code: pseudo-tested...)
Go(Node node)
{
  if (!node) return;
  // do whatever you need to do with node
  Go(node.Sibling);
  Go(node.Child);
}
 
Share this answer
 

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900