Function count

javascript/1448-Count-Good-Nodes-in-Binary-Tree.js:13–18

(root, max, total)

};

const count = (root, max, total) => {
    const isBaseCase = root === null;
    if (isBaseCase) return 0;

    return dfs(root, max, total);
}

const dfs = (root, max, total) => {
    const isGood = max <= root.val