1public class TreeNode {
2    public int val;
3    public TreeNode left;
4    public TreeNode right;
5    public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {
6        this.val = val;
7        this.left = left;
8        this.right = right;
9    }
10}
11
12public class Solution {
13    private int Dfs(TreeNode node, int maxVal) {
14        if (node == null) return 0;
15        int good = (node.val >= maxVal) ? 1 : 0;
16        maxVal = Math.Max(maxVal, node.val);
17        good += Dfs(node.left, maxVal);
18        good += Dfs(node.right, maxVal);
19        return good;
20    }
21
22    public int GoodNodes(TreeNode root) {
23        return Dfs(root, root.val);
24    }
25}
26

#include <queue>
using namespace std;

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};

class Solution {
public:
    int goodNodes(TreeNode* root) {
        if (!root) return 0;
        queue<pair<TreeNode*, int>> q;
        q.push({root, root->val});
        int goodNodesCount = 0;
        while (!q.empty()) {
            auto [node, maxVal] = q.front(); q.pop();
            if (node->val >= maxVal) goodNodesCount++;
            if (node->left) q.push({node->left, max(maxVal, node->val)});
            if (node->right) q.push({node->right, max(maxVal, node->val)});
        }
        return goodNodesCount;
    }
};