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

Category: QuestionsWhat is the run time efficiency of an insertion algorithm in d-heap?
Editor">Editor Staff asked 1 month ago

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.

1 Answers
Editor">Editor Staff answered 1 month ago

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.