Breadth First Search
Last updated
What is Breadth First Search?
Breadth-First Search (BFS) is a searching algorithm that's used in tree or graph data structures. It starts from the root (the topmost node in the tree) and expands all neighboring nodes at the present depth prior to moving on to nodes at the next depth level. This technique uses a queue data structure to remember to explore the next vertex or node and every edge that leads to a vertex will be explored, which ensures the discovery of every vertex reachable from the source. BFS is complete in nature, which means if the searched node is in the tree, BFS is guaranteed to find it.
More in stage 11: Advanced Data Structures
- Advanced Data Structures
- Trie
- Segment Trees
- Fenwick Trees
- Disjoint Set (Union-Find)
- Suffix Trees and Arrays
- Binary Trees
- Tree Traversal
- Search Algorithms
- Binary Search Trees
- In-Order Traversal
- AVL Trees
- Pre-Order Traversal
- Depth First Search
- B-Trees
- Heap
- Post-Order Traversal
- Search Algorithms
- Breadth First Search
- Depth First Search
- Shortest Path Algorithms
- Dijkstra's Algorithm
- Bellman-Ford Algoritm
- A* Algorithm
- Minimum Spanning Tree
- Prim's Algorithm
- Kruskal's Algorithm
Breadth First Search: common questions
Can I learn Breadth First Search in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Breadth First Search in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this Breadth First Search tutorial for beginners?
It is lesson 63 of 107 in the free Data Structures & Algorithms roadmap, in stage 11, Advanced Data Structures. If you are new to Data Structures & Algorithms, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.