I'm studying for my finals and I can across this statement.For a fixed set of (unique) keys, any binary search tree containing those keys canbe converted to any other BST on the same set of keys via a sequence of left- and/or right-rotations.I'm interested in a proof. Does anyone know any references?
Unique keys in a binary search tree
algorithms;algorithm analysis;binary trees