Parallel methods for tree traverse

Two parallel methods for making tree traverse on a cluster computing system are proposed. Experimental results concerning the methods are given for $k$-order trees, for combination trees, and for optimal appointment trees.