1448. Count Good Nodes in Binary Tree
/**
* Definition for a binary tree node.
* 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 dfs(TreeNode* root, int now_max) {
if(!root) return 0;
int is_good = 0;
if(root->val >= now_max) {
is_good = 1;
now_max = root->val;
}
return is_good + dfs(root->left, now_max) + dfs(root->right, now_max);
}
int goodNodes(TreeNode* root) {
return dfs(root, INT_MIN);
}
};