I have a tree that consists of several objects, where each object has a name (string
), id (int
) and possibly an array of children that are of the s
Well, you could always use recursion, but in a "real world" programming scenario, it can lead to bad things if you don't keep track of the depth.
Here's an example used for a binary tree: http://www.codeproject.com/KB/recipes/BinarySearchTree.aspx
I would google linked lists and other tree structures if you're new to the whole data structure thing. There's a wealth of knowledge to be had.