Arrange nodes that contain the letters D, Q, X, F, S, G, and W into two binary search trees: one that has maximum height and one that has minimum height.
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.