Implementation: Recursive aggregates

• How to efficiently maintain position in a recursive aggregate like a tree? Can’t keep pointer into guts of data structure without special access. Can’t use a simple index without forcing Aggregate to re-traverse to the right node at each iteration.