Explanation: Best-first search is an instance of the general TREE-SEARCH or GRAPH-SEARCH algorithm in which a node is selected for expansion based on an evaluation function, f (n) . Traditionally, the node with the lowest evaluation is selected for expansion, because the evaluation measures distance to the goal. 6. Best-First search can be implemented using the following data structure.
A. Queue
B. Stack
C. Priority Queue
D. Circular Queue
Answer:A
Explanation: Best-first search is an instance of the general TREE-SEARCH or GRAPH-SEARCH algorithm in which a node is selected for expansion based on an evaluation function, f (n) . Traditionally, the node with the lowest evaluation is selected for expansion, because the evaluation measures distance to the goal. 6. Best-First search can be implemented using the following data structure.
A. Queue B. Stack C. Priority Queue D. Circular Queue