Arbitrary Order Operations on Trees

We consider techniques for the large scale parallel execution of algorithms on trees. We show that there is much parallelism in these algorithms, and introduce efficient means to exploit this parallelism. In particular, arbitrary order operations on trees are considered. An execution of a set arbitrary order operations must be equivalent to some sequential execution of a permutation of these operations.