How can we show that the set R={ left-rotation, right-rotation } is a complete system of transformations of a binary search trees representing the same set of keys in the sense
