πŸ‘¨β€πŸ’»
Coding Interview Patterns
⌘Ctrlk
πŸ‘¨β€πŸ’»
Coding Interview Patterns
  • Coding Interview Patterns
  • 1. Pattern: Sliding Window
  • 2. Pattern: Two Pointers
  • 7. Pattern: Tree Breadth First Search
    • 7.0 Introduction
    • 7.1 Binary Tree Level Order Traversal (easy)
    • 7.2 Reverse Level Order Traversal (easy)
    • 7.3 Zigzag Traversal (medium)
    • 7.4 Level Averages in a Binary Tree (easy)
    • 7.5 Minimum Depth of a Binary Tree (easy)
    • 7.6 Maximum Depth of Binary Tree (easy)
    • 7.7 Level Order Successor (easy)
    • 7.8 Connect Level Order Siblings (medium)
    • 7.9 Problem Challenge 1 - Connect All Level Order Siblings (medium)
    • 7.10 Problem Challenge 2 - Right View of a Binary Tree (easy)
  • 11. Pattern: Modified Binary Search
  • 16. Pattern: Topological Sort (Graph)
  • Contributor Covenant Code of Conduct
  • Page 1
Powered by GitBook
For the complete documentation index, see llms.txt. This page is also available as Markdown.

7. Pattern: Tree Breadth First Search

7.0 Introduction7.1 Binary Tree Level Order Traversal (easy)7.2 Reverse Level Order Traversal (easy)7.3 Zigzag Traversal (medium)7.4 Level Averages in a Binary Tree (easy)7.5 Minimum Depth of a Binary Tree (easy)7.6 Maximum Depth of Binary Tree (easy)7.7 Level Order Successor (easy)7.8 Connect Level Order Siblings (medium)7.9 Problem Challenge 1 - Connect All Level Order Siblings (medium)7.10 Problem Challenge 2 - Right View of a Binary Tree (easy)
Previous2.10 Minimum Window Sort (medium)
Next7.0 Introduction

Last updated 4 years ago