+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 Answer

+1 vote
by (672k points)
selected by
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.