## Pattern Name: Tree-breadth First Search (BFS)
- #### Description:
- #### Applicable Data Structures:
- [[Queue]] (FIFO), [[Trees]]
- #### Algorithm:
- [[Breadth First Search (BFS)]]
- #### Diagram:
- #### When to Use:
- Find the shortest path from the Root node to the target node
## Key Considerations
- #### General Tips:
- Convert the problem into a graph traversal problem
- #### Performance:
- #### Space:
## Use Cases
- TBD