## [965\. 單值二叉樹](https://leetcode-cn.com/problems/univalued-binary-tree/)
>Easy
#### 思路
判斷有沒有其他數字，那肯定就是要遍歷二叉樹。記錄節點值，判斷當前節點是否與其他的節點不同。遍歷二叉樹，也就是深度優先和廣度優先，這邊選用DFS。
嘗試寫一下代碼，AC！
#### 代碼
python3
```
class Solution:
def dfs(self, val, node):
if node is None:
return True
if node.val != val:
return False
return self.dfs(val, node.left) and self.dfs(val, node.right)
def isUnivalTree(self, root: TreeNode) -> bool:
if root is None:
return True
val = root.val
return self.dfs(val, root)
```
- 目錄
- excel-sheet-column-number
- divide-two-integers
- house-robber
- fraction-to-recurring-decimal
- profile
- kids-with-the-greatest-number-of-candies
- qiu-12n-lcof
- new-21-game
- product-of-array-except-self
- minimum-depth-of-binary-tree
- univalued-binary-tree
- shun-shi-zhen-da-yin-ju-zhen-lcof
- permutations
- satisfiability-of-equality-equations
- word-ladder-ii
- ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof
- palindrome-number
- network-delay-time
- daily-temperatures
- longest-common-prefix
- sum-of-mutated-array-closest-to-target
- 周賽專題
- make-two-arrays-equal-by-reversing-sub-arrays
- check-if-a-string-contains-all-binary-codes-of-size-k
- course-schedule-iv
- cherry-pickup-ii
- maximum-product-of-two-elements-in-an-array
- maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts
- reorder-routes-to-make-all-paths-lead-to-the-city-zero
- probability-of-a-two-boxes-having-the-same-number-of-distinct-balls
- shuffle-the-array
- the-k-strongest-values-in-an-array
- design-browser-history
- paint-house-iii
- final-prices-with-a-special-discount-in-a-shop