Abstractly, generalize the k-d heap so that only levels that branch on key #1 have two children (all others have one).
a. Do we need pointers?
b. Clearly, the basic algorithms still work; what are the new time bounds?
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.