How to find child records with N hierarchy in c#

Question

I am doing it since last many days but I am not sure how can i build my logic for this in c#. I have to build logic something like this.

For example

The scenario is A has two childs B and C. Now B has no child and C has childs records of D,E,F . same way it can be at any depth. but lets for now we are considering this case. Now I am starting from A and want to find all the descendant elements of A. so the result should be B,C,D,E,F.

but I am not sure how can i build my logic till n hierarchy. can anybody please suggest. I am planning to start my logic like this

Find all the childs of A
Now For Looop
 ........

Did you take a look to other posts on SO? For example this: http://stackoverflow.com/questions/443695/traversing-a-tree-of-objects-in-c-sharp — Adriano Repetti, May 21 '14 at 10:04
thanks Adriano. It seems that i got solution from your above link. Thank you very very much..... — Kartik Patel, May 21 '14 at 10:23

score 0 · Answer 1 · answered May 21 '14 at 09:50

you can sort this out with a simple recursive function.

here is the logic you want. I am not writing the while C# code would be happy to help any questions.

parent send as param 
Find all the childs of parent
Now For Looop
  check parent has child then write it and call this method again whit parent.child
end loop

in the main of your code call the method with A

How to find child records with N hierarchy in c#

1 Answers1