maxPathSum = function(root, maxValue = [ -Infinity ]) {
    pathSum(root, maxValue);

    return maxValue[0];
}
https://leetcode.com/problems/binary-tree-maximum-path-sum/
Time O(N) | Space O(H)
@param {TreeNode} root
@return {number}