Question

Mention the difference between breadth first search and best first search in artificial intelligence

Answer 1

In BFS the root node is expanded first, then all the successors of the root node are expanded, and in next step all the successors of every node are expanded, the process continues till the goal is achived. while
In DFS we explore the root node and traverse as far as possible from the root node untill the goal is achived.

2.In BFS the space complexity is more critical as compared to time complexity.