Q34
What is the typical use case for a min-heap in algorithms?
A.
To find the minimum element efficiently.
AnswerB.
To find the maximum element efficiently.
C.
To sort elements in descending order.
D.
To balance binary search trees.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board