Question

what is breadth-first search algorithm?? plz yaaar help interview hai aur plz 'i don't know mat bolnaaa​

Answer 1

Answer:

Explanation:

Hi‼️✌️✌️

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.

I hope it will help you

Answer 2

Answer:

Happy birthday brother