This post is a summary of common parallel algorithms and the implementation of common parallel data structures. The resource comes from the UT EE361C course I took this semester.
Tree Algorithm
Euler Tour Technique is used to get O(log n) time parallel algorithms for solving problems related to trees with n nodes.
First, Euler tour can be used to compute the height of a tree in O(logn) time, no matter the tree is balanced or not.