const average = (...args) => args.reduce((a, b) => a + b) / args.length;
average(1, 2, 3, 4);
// Result: 2.5
// calculate the average value for binary tree
const AvgValue = (root) => {
let result = [];
let avg = 0;
let sum = 0;
let queue = [root];
while (queue.length) {
let current = queue.shift();
result.push(current.data);
if (current.left) queue.push(current.left);
if (current.right) queue.push(current.right);
}
for (let i = 0; i < result.length; i++) {
sum = sum + result[i];
}
avg = Math.floor(sum / result.length);
return avg;
};