Tree Structures

[Jon Slaughter]

Is there any way to do an arbitrary recursive structure that is also
typesafe? (or somewhat. The issue being the last "leafs" in the structure)
I'm thinking one could create a class that is basically a parent and child
and if child is null then its the last elements ones in the list. Or is
there any built in collections that do this?

Thanks,
Jon

 

[Jon Slaughter]

Is there any way to do an arbitrary recursive structure that is also
typesafe? (or somewhat. The issue being the last "leafs" in the structure)
I'm thinking one could create a class that is basically a parent and child
and if child is null then its the last elements ones in the list. Or is
there any built in collections that do this?

For example,

public class Node

{

public Node Parent;

public LinkedList<Node> Nodes;

public LinkedList<UserControl> Children;

public Node() { }

}



So if Nodes is null then children is used. (on the flip side this allows
children without being parents on each node too which might come in handy)