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.