Files
LeetCode-Go/website/content/ChapterTwo/Breadth_First_Search.md
2020-08-09 00:39:24 +08:00

2.0 KiB

title type
Breadth First Search docs

Breadth First Search

Title Solution Difficulty Time Space 收藏
101. Symmetric Tree [Go]({{< relref "/ChapterFour/0101.Symmetric-Tree.md" >}}) Easy O(n) O(1)
102. Binary Tree Level Order Traversal [Go]({{< relref "/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md" >}}) Medium O(n) O(1)
103. Binary Tree Zigzag Level Order Traversal [Go]({{< relref "/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md" >}}) Medium O(n) O(n)
107. Binary Tree Level Order Traversal II [Go]({{< relref "/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md" >}}) Easy O(n) O(1)
111. Minimum Depth of Binary Tree [Go]({{< relref "/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md" >}}) Easy O(n) O(1)
126. Word Ladder II [Go]({{< relref "/ChapterFour/0126.Word-Ladder-II.md" >}}) Hard O(n) O(n^2) ❤️
127. Word Ladder [Go]({{< relref "/ChapterFour/0127.Word-Ladder.md" >}}) Medium O(n) O(n)
199. Binary Tree Right Side View [Go]({{< relref "/ChapterFour/0199.Binary-Tree-Right-Side-View.md" >}}) Medium O(n) O(1)
200. Number of Islands [Go]({{< relref "/ChapterFour/0200.Number-of-Islands.md" >}}) Medium O(n^2) O(n^2)
207. Course Schedule [Go]({{< relref "/ChapterFour/0207.Course-Schedule.md" >}}) Medium O(n^2) O(n^2)
210. Course Schedule II [Go]({{< relref "/ChapterFour/0210.Course-Schedule-II.md" >}}) Medium O(n^2) O(n^2)
515. Find Largest Value in Each Tree Row [Go]({{< relref "/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md" >}}) Medium O(n) O(n)
542. 01 Matrix [Go]({{< relref "/ChapterFour/0542.01-Matrix.md" >}}) Medium O(n) O(1)
993. Cousins in Binary Tree [Go]({{< relref "/ChapterFour/0993.Cousins-in-Binary-Tree.md" >}}) Easy O(n) O(1)
--------------------------------------- --------------------------------- -------------------------- ----------------------- ----------- --------