1class TreeNode:
2    def __init__(self, val=0, left=None, right=None):
3        self.val = val
4        self.left = left
5        self.right = right
6
7class Solution:
8    def dfs(self, node, maxVal):
9        if not node:
10            return 0
11        good = 1 if node.val >= maxVal else 0
12        maxVal = max(maxVal, node.val)
13        return good + self.dfs(node.left, maxVal) + self.dfs(node.right, maxVal)
14
15    def goodNodes(self, root):
16        return self.dfs(root, root.val)
17

#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;
    }
};