Available question text
Return an array where each element is the average of node values at that depth in a binary tree. This is a level-by-level aggregation problem (commonly solved with BFS or DFS accumulating sum/count per depth); n ≤ 10^4, node values fit 32-bit ints, and answers within 1e-5 are accepted.
Related questions
Continue with questions that share topics or the same question type.
- Reverse Odd Levels of Binary Tree
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Balance a Binary Search Tree
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 637. Average of Levels in Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source