Click here to Skip to main content
11,633,978 members (76,049 online)
Rate this: bad
good
Please Sign up or sign in to vote.
See more: C# Windows form
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 25-Oct-11 0:39am
Rate this: bad
good
Please Sign up or sign in to vote.

Solution 2

You can do it recursively, something like this:
void getChildren() {
   System.Console.WriteLine(this.ToString());
   foreach(child Node in Nodes) {
      child.getChildren();
   } 
}
Good luck!
  Permalink  
Rate this: bad
good
Please Sign up or sign in to vote.

Solution 1

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);
}
  Permalink  

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

  Print Answers RSS
0 OriginalGriff 8,658
1 Sergey Alexandrovich Kryukov 8,204
2 Mika Wendelius 6,645
3 F-ES Sitecore 2,321
4 Suvendu Shekhar Giri 2,095


Advertise | Privacy | Mobile
Web02 | 2.8.150728.1 | Last Updated 25 Oct 2011
Copyright © CodeProject, 1999-2015
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100