# Breadth First Search

#### 2022-07-08 11:19

> ##### Algorithms:
>
> #algorithm #BFS
>
> ##### Data structures:
>
> #DS #binary_tree
>
> ##### Difficulty:
>
> #CS_analysis #difficulty_easy
>
> ##### Additional tags:

##### Related problems:

##### Links:

- [cppreference]()

---

### What is Breadth First Search?

means BFS

### How does Breadth First Search work?

#### Example code

### Why and when to use it?

> [!tip] Whether to push root or root's nodes initially
> When checking the symmetry, [[Leetcode Symmetric-Tree]], push nodes to make sure the stack can be poped correctly.
> otherwise, check if the root node is needed and minimum amount of nodes in the tree is larger than 1
