The trouble with binary search trees is that they can become unbalanced depending on the order in which you insert values. Give an order for inserting the letters P, A, I, F, W, Q, N, X, E, C, G, S, B, Z such that your intermediate trees as well as the resulting tree are complete binary search trees. Please provide the resulting binary search tree along with the order. (Hint: it might be helpful to first draw the full/complete tree to figure out how the values must be arranged, then you can determine the order in which to insert them.)

Will rate thanks :)