Divide a binary search tree into two trees, one tree with key < K and the other tree with keys ≥ K, where K is any key in the 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.