Leetcode Problem 1120. Maximum Average Subtree

1120. Maximum Average Subtree

Leetcode Solutions

Define a helper function that performs a postorder traversal and returns a tuple (ValueSum, NodeCount) for each node.
In the helper function, if the current node is None, return (0, 0).
Recursively call the helper function on the left and right children of the current node.
Calculate ValueSum and NodeCount for the current node based on the values returned from its children.
Compute the average for the current node and update the maximum average if necessary.
Return (ValueSum, NodeCount) for the current node.
Call the helper function on the root node and return the maximum average found.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen