+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of the following methods is the best choice for complex applications?

(a) binary heap

(b) d-heap

(c) treap

(d) pairing heap

My question comes from Heap topic in section Heap of Data Structures & Algorithms I

I have been asked this question during an interview for a job.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
The correct option is (d) pairing heap

Best explanation: Pairing heap is the best choice for complex applications because it is simple and better than the others.

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.