But then .. think.. for every two pairs of nodes you have to check whether both are connected to root and then you will say yes/no. And you will have to do this for all disjoint components. It's right but not O(n^2).
-- 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.
