building tree structure

It depends. I just finished an implementation of a tree structure very much like the one rlsuth described, implemented using pointers and ArrayLists. Each node contains an ArrayList of child nodes and its parent.

Hi There is already an implementation of a LinkedList, HashSet... Maybe it helps... http://foleyutilities.sourceforge.net/index.html Cheers Simon

Easy... use pointers. Take a closer look at how reference types behave as variables and parameters in C# (same thing happens with Java) if you don't know what I mean. They're passed by reference.

but this is only for binary tree's, and what's needed is a structure more than binary nodes. I have an application that requres a dynamic tree structure. ie The tree depth isn't fixed and the number of nodes for any parent is from one to 40. How on earth do you implement that in C# (and I've googled without luck). I used to do it in Pascal, quite easily, using pointers.

Donald Knuth has an excellent book on sorting and searching. Pre and post-order traversing of binary trees is what you need. I can look it up and send you the pseudo code. Lali

You could search google with the keyword linked list. I think this is the principal you're looking for.