1function TreeNode(val, left, right) {
2    this.val = (val===undefined ? 0 : val)
3    this.left = (left===undefined ? null : left)
4    this.right = (right===undefined ? null : right)
5}
6
7const goodNodes = function(root) {
8    const dfs = (node, maxVal) => {
9        if (!node) return 0;
10        let good = 0;
11        if (node.val >= maxVal) good = 1;
12        maxVal = Math.max(maxVal, node.val);
13        good += dfs(node.left, maxVal);
14        good += dfs(node.right, maxVal);
15        return good;
16    };
17    return dfs(root, root.val);
18};
19

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