$13\mathrm{.}2-2$

Argue that in every n$-$node binary search tree, there are exactly n $-1$ possible rotations.