I typically write a function that uses FindFirstFile and FindNextFile and then the function just calls itself (recursively) if it comes to a sub-folder. Then it works its way back out eventually to the top. You can either pass in variables to count files/folders/etc. or you can have them be members of the class that contains the function. If you write a function that just finds all of

Interesting problem. First, I don't see any way to query directly for groups that have members that are groups. I see no better method than binding to each group, then binding to each member in the group to check if the member is a group, etc. This is a lot of binding, but seems unavoidable. With so many groups, the task can take awhile. Next, group nesting can be tricky. For example if