Q30
What kind of binary heap is used to efficiently support priority queues with the smallest element at the root?
A.
Min-heap
AnswerB.
Max-heap
C.
Fibonacci heap
D.
Binomial heap
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board