GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing leetcodejavascript.com — #1120 - Maximum Average Subtree - LeetCode JavaScript Solutions

Back to all solutions

#1120 - Maximum Average Subtree

Medium • View on LeetCode • View on GitHub

Depth-First Search Tree Binary Tree

Problem Description

Given the root of a binary tree, return the maximum average value of a subtree of that tree.

Answers within 10-5 of the actual answer will be accepted.

A subtree of a tree is any node of that tree plus all its descendants.

The average value of a tree is the sum of its values, divided by the number of nodes.

Solution

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number}
 */
var maximumAverageSubtree = function(root) {
  let maxAverage = 0;
  calculateSubtree(root);
  return maxAverage;

  function calculateSubtree(node) {
    if (!node) return [0, 0];

    const [leftSum, leftCount] = calculateSubtree(node.left);
    const [rightSum, rightCount] = calculateSubtree(node.right);
    const totalSum = leftSum + rightSum + node.val;
    const totalCount = leftCount + rightCount + 1;
    const currentAverage = totalSum / totalCount;

    maxAverage = Math.max(maxAverage, currentAverage);

    return [totalSum, totalCount];
  }
};

You are visitor 01402520 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.