Unformatted text preview: will need at most n1 right rotations. For example, In generic, to transform binary search tree to another binary tree, it will take at most n1 rotations. Which means O(n) rotations....
View
Full Document
 Spring '09
 Dr.Ayman
 Algorithms, Binary Search

Click to edit the document details