On the upper bound on the rotation distance of binary trees
The rotation distance between two binary search trees \(T_ 1\) and \(T_ 2\) on n nodes is the minimum number of rotations needed to transform \(T_ 1\) into \(T_ 2\). It is known that an upper bound to the rotation distance is 2n-6. The authors present a proof of the bound by a tree transformation algorithm.
scientific article; zbMATH DE number 4114656