# 7. Pattern: Tree Breadth First Search

- [7.0 Introduction](/coding-interview-patterns/untitled/7.0-introduction.md)
- [7.1 Binary Tree Level Order Traversal (easy)](/coding-interview-patterns/untitled/7.1-binary-tree-level-order-traversal-easy.md)
- [7.2 Reverse Level Order Traversal (easy)](/coding-interview-patterns/untitled/7.2-reverse-level-order-traversal-easy.md)
- [7.3 Zigzag Traversal (medium)](/coding-interview-patterns/untitled/7.3-zigzag-traversal-medium.md)
- [7.4 Level Averages in a Binary Tree (easy)](/coding-interview-patterns/untitled/7.4-level-averages-in-a-binary-tree-easy.md)
- [7.5 Minimum Depth of a Binary Tree (easy)](/coding-interview-patterns/untitled/7.5-minimum-depth-of-a-binary-tree-easy.md)
- [7.6 Maximum Depth of Binary Tree (easy)](/coding-interview-patterns/untitled/7.6-maximum-depth-of-binary-tree-easy.md)
- [7.7 Level Order Successor (easy)](/coding-interview-patterns/untitled/7.7-level-order-successor-easy.md)
- [7.8 Connect Level Order Siblings (medium)](/coding-interview-patterns/untitled/7.8-connect-level-order-siblings-medium.md)
- [7.9 Problem Challenge 1 - Connect All Level Order Siblings (medium)](/coding-interview-patterns/untitled/7.9-problem-challenge-1-connect-all-level-order-siblings-medium.md)
- [7.10 Problem Challenge 2 - Right View of a Binary Tree (easy)](/coding-interview-patterns/untitled/7.10-problem-challenge-2-right-view-of-a-binary-tree-easy.md)