Leetcode 1161. Maximum Level Sum of a Binary Tree
Compute the sum of node values at each depth of a binary tree and return the smallest level index with the maximum sum. This is typically solved with a level-order (BFS) traversal; note nodes ≤ 10^4 and values may be negative.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.