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.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.