Function pathSum

javascript/0124-binary-tree-maximum-path-sum.js:13–18

(root, maxValue)

};

const pathSum = (root, maxValue) => {
    const isBaseCase = root === null;
    if (isBaseCase) return 0;

    return dfs(root, maxValue);
};

const dfs = (node, maxValue) => {
    const left = Math.max(0, pathSum(node.left, maxValue));