Best-First search can be implemented using the following data structure.
A. Queue
B. Stack
C. Priority Queue
D. Circular Queue
Answer:C
Best-First search can be implemented using the following data structure.
A. Queue B. Stack C. Priority Queue D. Circular Queue
Explanation: Best-first search can be implemented within our general search framework via a priority queue, a data structure that will maintain the fringe in ascending order of f-values.