Python Algorithms Traing Basic
latest
chapter 1: Array
chapter 2: Backtracking
chapter 3: Binary Search
chapter 4: Bit manipulation
chapter 5: Breadth First Search
Breadth First Search - Easy
Breadth First Search - Medium
Breadth First Search - Hard
chapter 6: Combination
chapter 7: Depth First Search
chapter 8: DFA
chapter 9: DivideConquer
chapter 10: Dynamic Programming
chapter 11: Graph
chapter 12: Greedy
chapter 13: Hash table
chapter 14: Heap
chapter 15: Linked List
chapter 16: Math
chapter 17: Others
chapter 18: Recursion
chapter 19: Stack
chapter 20: String
chapter 21: ToBeOptimized
chapter 22: Tree
chapter 23: Two Pointers
Python Algorithms Traing Basic
Docs
»
chapter 5: Breadth First Search
Edit on GitHub
chapter 5: Breadth First Search
¶
Breadth First Search - Easy
102. Binary Tree level order traveral
103. Binary tree zigzag level order traversal
104. Maximum depth of binary tree
107. Binary tree level order traveral 2
126. word ladder 2
127. word ladder
130. Surrounded regions
199. Binary tree right side view
310. Minimum height trees
322. coin change
Breadth First Search - Medium
Breadth First Search - Hard