Count Good Nodes in Binary Tree | LeetCode | Java

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