Hi All, this one is from CLR. A binary search tree T1 can be "right-converted" to another binary search tree T2 (made from the same keys) if there exist a series of "right-rotations" applying which T1 becomes T2. Given T1, is T1 right-convertible to all possible T2s? If T1 can be right-converted to T2, how many right-rotations are needed?
--~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
