Count Good Nodes in Binary Tree | LeetCode | Java

Code

class Solution {
    int count = 0;

    public int goodNodes(TreeNode root) {
        countGoodNodes(root, root.val);
        return count;
    }

    void countGoodNodes(TreeNode node, int val){
        if(node==null)
            return;

        if(node.val>=val){
            val = node.val;
            count++;
        }

        countGoodNodes(node.left, val);
        countGoodNodes(node.right, val);
    }
}

Thanks for reading :)
Feel free to comment and like the post if you found it helpful
Follow for more 🤝 && Happy Coding 🚀

If you enjoy my content, support me by following me on my other socials:
https://linktr.ee/tanujav7