Go through a nested data structure

Question

0.00/5 (No votes)

See more:

I have a kind of own tree structure.

As you can see, this can have any depth. However, I have problems going through this structure now. With foreach loops, I can always search only one list, but not the children lists. How would you do that?

What I have tried:

public class MyClass
{
   public string Name{ get; set; }
   public List<MyClass> Children { get; set; }
}

Posted 27-Jun-18 21:52pm

Member 13725613

Updated 27-Jun-18 22:44pm

v3

Add a Solution

2 solutions

Solution 2

Given a search() function :

C#

public MyClass search(Myclass node)
{
    foreach(var c in node.Children)
    {
       // search code here if found
       // return c

       // else go down
       var ret = search(c);
       if(ret != null)
          return ret;
    }
    return null;
}

You can switch the blocks to do depth first search.

Posted 27-Jun-18 22:29pm

Mehdi Gholam

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

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

OriginalGriff · Accepted Answer · 2018-06-27T22:21:00

This is an English language site, and we only accept and answer questions in that language. In future, please use Google Translate to help post your question - it does a pretty good job!

The easiest way to process lists of lists where the depth is unknown is to use recursion:

C#

public void Process(MyClass mc)
   {
   ... Process instance mc ...
   if (mc.Children != null)
      {
      foreach (MyClass child in mc.Children)
         {
         Process(child);
         }
      }
   }

Pass it the "main item" and it will perform the same operation on each child, regardless of the depth.