 In a tree data structure where each node points to its parent, the lowest common ancestor can be easily determined by finding the first intersection of the paths from and to the root.In general, the computational time required for this algorithm is where is the height of the tree (length of longest path from a leaf to the root).However, there exist several algorithms for processing trees so that lowest common ancestors may be found more quickly.