* Nearest Common Ancestor* Given a rooted tree of size * n *. You receive a series of online queries : * "Give nearest common ancestor of u,v " *. Your objective is to preprocess the tree in * O(n) * time to get a data structure of size * O(n) * so that you can answer any such query in * O(log n) * time.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
