Q22
What is the primary use of heaps in graph algorithms?
A.
For implementing priority queues.
AnswerB.
For managing hierarchical data.
C.
For sorting elements.
D.
For balancing search trees.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board