1) Suppose the node which you hold is P 2) Navigate on path from P to Root of Tree[Upside] and flip the relationship direction for every edge you encounter on the path 3) Make P as Root of tree 4) redraw(P);
-Regards Amit Agarwal blog.amitagrwal.com On Fri, Oct 8, 2010 at 1:29 PM, snehal jain <[email protected]> wrote: > If we consider the edges in binary tree as threads and nodes in the > tree as weights hanging from it(it is suspended from the root) then > how the tree structure will change when the tree is hung from a > particular leaf. > > -- > 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- 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.
