Optimal concurrent tree traversals

We present global and local algorithms for generating trave rsals of arbitrary trees with the property that the maximum number of edges between successiv e nodes in any traversal is three, and that this is the best possible result. We describe the app lic tion of such traversals to parallel computing.