Find node A = LCA(x, z). If y lies on the path x->z (or reverse), then A should be either on the path A-x, or A-z. Also this can be find while searching LCA, it depends on the used algorithm for this.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
