# A d-ary heap is like a binary heap, but (with one possible exception) non-leaf nodes have d children instead of

## Question:

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.

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

## Step by Step Answer:

**Related Book For**

## Introduction to Algorithms

**ISBN:** 978-0262033848

3rd edition

**Authors:** Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

**View Solution**

Create a free account to access the answer

**Cannot find your solution?**

Post a FREE question now and get an answer within minutes.
* Average response time.