Function dfs

javascript/1448-Count-Good-Nodes-in-Binary-Tree.js:20–28

(root, max, total)

}

const dfs = (root, max, total) => {
    const isGood = max <= root.val
    if (isGood) total[0]++;

    max = Math.max(max, root.val);

    count(root.left, max, total);
    count(root.right, max, total);
}

/**
 * https://leetcode.com/problems/count-good-nodes-in-binary-tree/