Glad I persisted - you're right, it's O(2^n), not O(2n). That seems pretty important to know: at each level it has to traverse up two trees. If the hierarchy is small, no biggie, but if the document hierarchy could get deep that's gonna hurt.