var diameterOfBinaryTree = function(root) {
let max = 0;
const dfs = (node) => {
if (!node) return -1
let left = dfs(node.left);
let right = dfs(node.right);
max = Math.max(max, 2 + left + right);
return Math.max(left, right) + 1
}
dfs(root);
return max;
};