>Hi,
> I am developing application for multi-marketing. I need to search for entire down line for input "root" name. There may more than one direct down line under the root. A child can be the root of next level. Any method that can be used to identify the root (either searched before or not) that more effective?
> I tried to delete the record for temporary, but it may take too long time. What is the optimised time usually needed for this which the root may have 10000 level of down lines?
> What search method should be used ? SEEK or locate?
>
>Thank you

John,

Are you saying that on one branch of the tree it may hit 10,000 levels or are you saying that there may be 10,000 nodes under a single root? These are two very different situations. With 10,000 nodes under a root recursioon can be used as the 128 levels of recursion are not limiting to this factor. However, with 10,000 levels in a branch, recursion will not work and using loops to traverse the tree will be necessary.