Leetcode 1120. Maximum Average Subtree

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1120. Maximum Average Subtree

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact