Sorting is a rather drastic way to make a binary search tree balanced.
Sometimes we can get by with more ``local'' adjustments.
