Generalize the preceding exercise to obtain a k-d heap, in which each item canhave k
Chapter 12, Problem 12.21(choose chapter or problem)
Generalize the preceding exercise to obtain a k-d heap, in which each item canhave k individual keys. You should be able to obtain the following bounds: insertin O(logN), deleteMin in O(2k logN), and buildHeap in O(kN)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer