leetCode/leetCode_1448.java at master · mehtabgill/leetCode · GitHub

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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    int count = 0;

    public int goodNodes(TreeNode root) {
        if(root == null){
            return count;
        }
        count = 1;

        trav(root);
        return count;
    }

    void trav(TreeNode root){
        if(root == null){
            return ;
        }
        if(root.left != null){
            if(root.val <= root.left.val){
                count++;
            }
            else{
                root.left.val = root.val;
            }
        }
       if(root.right != null){
            if(root.val <= root.right.val){
                count++;
            }
            else{
                root.right.val = root.val;
            }
        }
          trav(root.left);
          trav(root.right);
    }
}