Out of the following given options, which is the fastest algorithm?

(a) fibonacci heap

(b) pairing heap

(c) d-ary heap

(d) binary heap

My enquiry is from Heap in section Heap of Data Structures & Algorithms I

This question was posed to me in a job interview.