Use cases of DFS and BFS

labuladongOriginalAbout 2121 words

Prerequisite Knowledge

Before reading this article, you need to first learn:

Recursion/Level Order Traversal of Binary Trees

In real algorithm problems, the DFS algorithm is commonly used to enumerate all paths, while the BFS algorithm is often used to find the shortest path. Why is this the case?

Because recursive and level order traversals of binary trees are the simplest forms of DFS and BFS algorithms, this article will use a simple binary tree example to illustrate the reasoning.

Use cases of DFS and BFS

111. 二叉树的最小深度 https://leetcode.cn/problems/minimum-depth-of-binary-tree

111. Minimum Depth of Binary Tree https://leetcode.com/problems/minimum-depth-of-binary-tree

Why BFS is Commonly Used to Find the Shortest Path

Why DFS is Commonly Used to Find All Paths