426. Convert Binary Search Tree to Sorted Doubly Linked List
426. Convert Binary Search Tree to Sorted Doubly Linked List
Tree
323. Number of Connected Components in an Undirected Graph
可以繼承 547. Number of Provinces 的做法，先轉換給定的 edges 成一個矩陣。
class
102. Binary Tree Level Order Traversal
102. Binary Tree Level Order Traversal
BFS
# Definition for a
117. Populating Next Right Pointers in Each Node II
117. Populating Next Right Pointers in Each Node II
"
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
1379. Find a Corresponding Node of a Binary Tree in
116. Populating Next Right Pointers in Each Node
116. Populating Next Right Pointers in Each Node
這一題要考的點是對進行 BFS
700. Search in a Binary Search Tree
700. Search in a Binary Search Tree
如果說題目只是問「樹」中是否存在一個節點有某個值，
450. Delete Node in a BST
450. Delete Node in a BST
這個題目給定的條件可以很簡單：給定一個數值，要我們在二元搜尋樹中找到哪個節點的數值等於此值，並且刪掉他。
752. Open the Lock
752. Open the Lock
class Solution:
def openLock(self, deadends:
104. Maximum Depth of Binary Tree
104. Maximum Depth of Binary Tree
# Definition for a binary