Explanation: Depth-first search always expands the deepest/leaf node in the current fringe of the search tree. 10. Breadth-first search always expands the ______ node in the current fringe of the search tree.
A. Shallowest
B. Child node
C. Deepest
D. Minimum cost
Answer:A
Explanation: Depth-first search always expands the deepest/leaf node in the current fringe of the search tree. 10. Breadth-first search always expands the ______ node in the current fringe of the search tree.
A. Shallowest B. Child node C. Deepest D. Minimum cost
Explanation: Breadth-first search always expands the shallowest node in the current fringe of the search tree. Traversal is performed level wise. Sanfoundry Global Education & Learning Series – Artificial Intelligence.