# 1448. Count Good Nodes in Binary Tree ![image](https://hackmd.io/_uploads/Sk4g6UkV6.png) ![image](https://hackmd.io/_uploads/S1Ye6814a.png) 題目要求找到 GOOD 也就是root.val>=pre.root.val 那我們就可以用這個道理來判斷 然後依序的左右下去 ![image](https://hackmd.io/_uploads/ByRep8k4p.png)