Currently trying to solved Diameter of Binary Tree problem using js. I got a weird code when I do not include const when declaring left/right. Does anyone know why?
var diameterOfBinaryTree = function(root) {
const result = dfs(root, 0);
return result[1];
};
const dfs = (node, diameter) => {
if(!node)
return [0, 0];
const left = dfs(node.left, diameter);
const right = dfs(node.right, diameter);
let oldDiameter = Math.max(left[1], right[1], diameter);
let newDiameter = Math.max(oldDiameter, left[0] + right[0]);
let depth = Math.max(left[0], right[0]) + 1;
return [depth, newDiameter];
}