Abstractly, generalize the k-d heap so that only levels that branch on key #1 have two children

Question:

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 links?
b. Clearly, the basic algorithms still work; what are the new time bounds?
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: