Question

I have a N-Ary non sorted in any way tree and each node can have 0-N children. Given the data structure below, how can I fill the tree view assuming you have an array of TermNodes and that array is the first level of the TreeView? I have not been able to come up with a recursive way to do this.

class TermNode {    public string Name;    public string Definition;    public List<TermNode> Children } 

Answer 1

Thanks All I was getting confused because I did not realize that for a given TreeNode tn, tn.Nodes.Add would return the added TreeNode Once you know that the solution is straight forward like so

private void /*TreeNode*/ RecursiveAdd(OntologyNode on, TreeNode tn) {     if (on.Children.Count == 0)     {         return;                  }     foreach (OntologyNode child in on.Children)     {         TreeNode tCur = tn.Nodes.Add(child.Name);         tCur.Tag = child;//optional for some selected node events         RecursiveAdd(child, tCur);                    }  } 

and to start of the recursive call

foreach( OntologyNode on in Nodes )  {      if (on.IsTopLevelNode == true)// internal not pertinent to this code snippet      {           TreeNode tn = tvOntoBrowser.Nodes.Add(on.Name);           tn.Tag = on;           if (on.Children.Count > 0)           {                RecursiveAdd(on, tn);           }      }    }