Tree

1926. Nearest Exit from Entrance in Maze

1926. Nearest Exit from Entrance in Maze 這個問題屬於 BFS 的問題

1992. Find All Groups of Farmland

1992. Find All Groups of Farmland class Solution: def findFarmland(

1302. Deepest Leaves Sum

1302. Deepest Leaves Sum # Definition for a binary tree node.

938. Range Sum of BST

938. Range Sum of BST 這個題目雖然是簡單,但應該只是實作簡單,真的寫起來不是這麼好想。 我的第一個想法是利用 BST

270. Closest Binary Search Tree Value

270. Closest Binary Search Tree Value 這個題目被標記為簡單是因為這個題目存在著一個簡單的解法,但是這個題目存在一個更優解,這個更優解就很難想得到。 簡單的解法是,

103. Binary Tree Zigzag Level Order Traversal

103. Binary Tree Zigzag Level Order Traversal # Definition for a

515. Find Largest Value in Each Tree Row

515. Find Largest Value in Each Tree Row 題目要熟悉 BFS

1026. Maximum Difference Between Node and Ancestor

1026. Maximum Difference Between Node and Ancestor 這題要找的是 「某個節點與它的祖先節點之間的差異最大值」。節點的選擇可以是樹中的任何一點,

298. Binary Tree Longest Consecutive Sequence

298. Binary Tree Longest Consecutive Sequence 參考:257. Binary Tree

129. Sum Root to Leaf Numbers

129. Sum Root to Leaf Numbers 請參考 257. Binary Tree