Question

What Is Breadth First Search

Answer 1

Answer:

Breadth is another name of width.

Hope the answer will help you plz mark it as the brainliest

Answer 2

Answer:

Breadth-first search is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root, and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.

Inventor:- Edward. F. Moore.

Worst complexity: O(|E|) = O(b^d).

Space complexity: O(|V|) = O(b^d).

Data structure: Graph.

Class: Search algorithm

Hope it's helpful...