Tree traversing.

[Anon]

Ok this is what I am trying to do. It can be looked at as a tree.
I am receiving a top level value.
I wrote a function which adds its children values to an array.
Now, i want to end up with an array of all the elements in the tree. ie: all the children of all the children of the top level value.
I dont know how many levels there is.

I am sure I did this is school... but I can't seem to figure it out again.

Could someone gimme a hand?

[Anon]

You could use a recursive function that got all the children, and looped through calling itself with each of children, and then returned if there were no children. You might remember recursion from school? Let me know if you need examples.

Good Luck,
Adam

[Anon]

Thanx,
As I was writing the question, I broke it down in my mind, and wrote a simple Iterative loop which did the same thing!!
*I got all the top level children and placed them in an array. Then I called the Getchildren function on every element of the array, adding the children to the array.
Therefore eventually calling Getchildren on every element.
It works!

Thank You,
Andre

[Anon]

Can this be done in the case of not having info on the children but just info on who the parent is ???

thanks!