Given the root of a binary tree, a node X is considered good if on the path from the root to X, there are no nodes with a value greater than X.

Return the total number of good nodes in the binary tree.

Constraints:

• The number of nodes in the binary tree is in the range $[1, 10^5]$.

• $-10^4 \leq$ Node.val $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.