Write a function to generate a perfectly balanced binary search tree of height h with keys 1 through 2h+1 − 1. What is the running time of your function?
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.