Question: A d-ary heap is like a binary heap, but (with one possible exception) non-leaf nodes have d children instead of 2 children. a. How would
a. How would you represent a d-ary heap in an array?
b. What is the height of a d-ary heap of n elements in terms of n and d?
c. Give an efficient implementation of EXTRACT-MAX in a d-ary max-heap. Analyze its running time in terms of d and n.
d. Give an efficient implementation of INSERT in a d-ary max-heap. Analyze its running time in terms of d and n.
e. Give an efficient implementation of INCREASE-KEY (A, i, k), which first sets A[i] ← max (A[i], k) and then updates the d-ary max-heap structure appropriately. Analyze its running time in terms of d and n.
Step by Step Solution
3.41 Rating (151 Votes )
There are 3 Steps involved in it
a A dary heap can be represented in a 1dimensional array as follows The root is kept in A1 its d chi... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
C-S-A (86).docx
120 KBs Word File
