Q51
Which data structure is most suitable for implementing best first branch and bound strategy?
A.
stack
B.
queue
C.
priority queue
AnswerD.
linked list
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board