Breadth-first search

In computer science, breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and explores all nodes at the present depth prior to moving on to the nodes at the next depth level. Extra memory, usually a queue, is needed to keep track of the child nodes that were encountered but not yet explored.

Back to Algorithms →

Source: Wikipedia · Image: Wikimedia Commons · CC BY-SA 3.0

ALGOHAY

Algorithms, demystified — data-structure guides, complexity tools, and interview prep for developers.

Get new guides by emailOccasional emails. No spam. Unsubscribe anytime.

InformationAbout Contact Privacy Policy Terms of Service Disclaimer Affiliate Disclosure Cookie Policy

Every algorithm, image, fact, and figure in the museum is drawn from Wikipedia and Wikimedia Commons, used under public-domain and Creative Commons licenses. No content is AI-generated.