Data-Structures-and-Algorithms/CPP/Leetcode/1448-count-good-nodes-in-binary-tree/1448-count-good-nodes-in-binary-tree.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub

Name: Data-Structures-and-Algorithms/CPP/Leetcode/1448-count-good-nodes-in-binary-tree/1448-count-good-nodes-in-binary-tree.cpp at main · codemistic/Data-Structures-and-Algorithms · GitHub
Rating: 4.7 (6536 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/**
 * 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) {}
 * };
*/
classSolution {


public:
int cnt=0;
voidsearch(TreeNode *root,int max)
 {
if(!root) return;
if(root->val >=max)
 {
 cnt++;
 max=root->val;
 }
search(root->left,max);
search(root->right,max);
 }

intgoodNodes(TreeNode* root) {
search(root,root->val);
return cnt;
 }
};