Skip to content

Breadth-first search (BFS) and Depth-first search (DFS) tree traversal algorithm.

Notifications You must be signed in to change notification settings

Swarnadeep08/BFS-DFS

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

BFS-DFS

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.
Depth-first search (DFS) − It is a tree traversal algorithm that traverses the structure to its deepest node.

About

Breadth-first search (BFS) and Depth-first search (DFS) tree traversal algorithm.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages