Suppose the following values are to be inserted into a binary search tree:
A, B, C, D, E, F, G
Inserting the values in different orders results in different shapes of trees. What ordering results in an optimal (complete) tree? Show the resulting tree.