Hi. I need some help. I want to know why there are exactly n-1 possible rotations on a binary search tree?.
