Binary Tree Count good nodes

# Binary Tree Count good node ## 原文 https://leetcode.com/problems/count-good-nodes-in-binary-tree/description/ ## 題意計算好節點總數。 ## What is good node ? 從任意節點到這一個節點，假設任意節點都比節點小或是相等，即為好節點。 ## 變數說明任意節點中抓最大的 `maxValue` ; 這一個節點 `node.value` ; ```python3=1 res = 1 if maxValue <= node.value else 0 ``` aka (also known as) ```python3=1 res = 1 if node.value >= maxValue else 0 ``` ## playground https://leetcode.com/problems/count-good-nodes-in-binary-tree/submissions/ ## ref https://youtu.be/7cp5imvDzl4?si=goh--WJ5Puax89TT