what is breath first search?
Answers
Answered by
0
Breadth-first search (BFS) is an algorithm for traversing or searchingtree or graph data structures. ... It uses the opposite strategy as depth-first search, which instead explores the highest-depth nodes first before being forced to backtrack and expand shallower nodes.
If you like my answer so please mark it as brainliest.
If you like my answer so please mark it as brainliest.
Similar questions