Give five orderings of the keys A X C S E R H that, when

inserted into an initially empty BST$,$ produce the best$-$case tree.

You can also describe the constraints that produce this outcome

$---$ Things like "insert A first, insert B before C$,$ etc."