Available question text
Given a binary tree of numeric node values, find the subtree (a node plus all its descendants) with the maximum average value; solve by a post-order DFS that computes subtree sums and sizes and tracks the highest sum/size ratio in O(n) time.
Related questions
Continue with questions that share topics or the same question type.
- Average Salary Excluding the Minimum and Maximum Salary
Coding
- Count Nodes Equal to Average of Subtree
Coding · Binary Tree · Depth-First Search · Tree
- Maximum Average Pass Ratio
Coding
- Maximum Average Subarray I
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1120. Maximum Average Subtree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source