Which operation is not efficiently performed in a d-heap?

Category: QuestionsWhich operation is not efficiently performed in a d-heap?
Editor">Editor Staff asked 4 weeks ago

Which operation is not efficiently performed in a d-heap?
 
(a) insert
 
(b) delete
 
(c) find
 
(d) merge
 
The origin of the question is Heap in chapter Heap of Data Structures & Algorithms I
 
I had been asked this question by my school principal while I was bunking the class.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Right option is (d) merge
 
The best I can explain: Unlike find operation, which cannot be performed in a d-heap, the task of merging two d-heaps is very difficult.