On which algorithm is heap sort based on?
(a) Fibonacci heap
(b) Binary tree
(c) Priority queue
(d) FIFO
This question was posed to me during an online interview.
I'd like to ask this question from Heapsort in chapter Sorting of Data Structures & Algorithms II