Insert(T, 6)

For a sequence of integers in the range , which insertion order will yield the tallest tree? Inserting in sorted order or reverse sorted order.

Which insertion order will yield the shortest tree? Insert the median first, then the medians of the subarrays, and so on.