872. Leaf-Similar Trees
872. Leaf-Similar Trees
# Definition for a binary tree node.
# class
Tree
1466. Reorder Routes to Make All Paths Lead to the City Zero
1466. Reorder Routes to Make All Paths Lead to the
1091. Shortest Path in Binary Matrix
1091. Shortest Path in Binary Matrix
可以先練習這些題目
* 200. Number of
449. Serialize and Deserialize BST
449. Serialize and Deserialize BST
參考 297. Serialize and Deserialize
1490. Clone N-ary Tree
1490. Clone N-ary Tree
這個題目是樹，題目要考察是否可以寫出遍歷整棵樹的程式碼，類似的題目是 133. Clone Graph
106. Construct Binary Tree from Inorder and Postorder Traversal
106. Construct Binary Tree from Inorder and Postorder Traversal
postorder
559. Maximum Depth of N-ary Tree
559. Maximum Depth of N-ary Tree
"""
# Definition
286. Walls and Gates
286. Walls and Gates
題目給定一個矩陣，矩陣內有標記了牆與門，剩餘的點被標註成一個無限大的數值，意義為可以行走的點，要求把這些矩陣中除了門與牆以外的點，以該點到達附近最近的門的距離為何？
124. Binary Tree Maximum Path Sum
124. Binary Tree Maximum Path Sum
這一題是後序遍歷的經典題目，後序遍歷的精神就是先將子樹的問題全部解決，再開始處理跟節點的問題，這一題要怎麼想到的確是屬於困難的題型。
437. Path Sum III
437. Path Sum III
更難的樹的遍歷加上回溯法。
# Definition for a binary tree