Question

What is the run time efficiency of an insertion algorithm in d-heap?

(a) O(N)

(b) O(log N)

(c) O(logd N)

(d) O(N^d)

The query is from Heap topic in portion Heap of Data Structures & Algorithms I

This question was posed to me by my college director while I was bunking the class.

Answer 1

Right option is (c) O(logd N)

Easy explanation - The run time efficiency of an insertion algorithm in a d-heap is found to be O(logd N) where d is the number of children.