Vidyalelo
Data Structure · Q103

Heaps

Programming · Data Structure · question 103

Q103

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

A.
O(N)
B.
O(log N)
C.
O(logd N)
Answer
D.
O(Nd)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board