+1 vote
in Data Structures & Algorithms I by (88.2k points)
d-heap is shallower than a binary heap.

(a) true

(b) false

Origin of the question is Heap topic in division Heap of Data Structures & Algorithms I

I had been asked this question in an internship interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
The correct choice is (a) true

The explanation is: d-heap is much shallower than a binary heap with respect to performance efficiency of insert and delete operations.

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.