>Thanks. Say, if I don't do it the way I was thinknig, how would the record oriented way work?

It would depend on whether the parent contained a pointer to the children or the other way around. A binary tree is usually implemented as the parent pointed to the children. Other trees usually have the children containing a pointer to the parent. So given a parent, it's easy to find all the children. Recursion works really well, depending on the expected depth of the tree.

-Mike