ConceptBFS
Breadth-First Search
A graph search algorithm that expands level by level starting from a root node, used to find shortest paths.
Timeline (last 90 days)
Oct 18
Tree traversal is an algorithm for visiting every node of a tree structure, and common approaches include depth-first search (DFS) and breadth-first search (BFS).
Unverified50%