diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index b74f1a0b..a99449fb 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -1006,6 +1006,30 @@ func averageOfLevels(_ root: TreeNode?) -> [Double] {
     return result
 }
 ```
+Scala:
+```scala
+// 637.二叉树的层平均值
+object Solution {
+  import scala.collection.mutable
+  def averageOfLevels(root: TreeNode): Array[Double] = {
+    val res = mutable.ArrayBuffer[Double]()
+    val queue = mutable.Queue[TreeNode]()
+    queue.enqueue(root)
+    while (!queue.isEmpty) {
+      var sum = 0.0
+      var len = queue.size
+      for (i <- 0 until len) {
+        var curNode = queue.dequeue()
+        sum += curNode.value // 累加该层的值
+        if (curNode.left != null) queue.enqueue(curNode.left)
+        if (curNode.right != null) queue.enqueue(curNode.right)
+      }
+      res.append(sum / len) // 平均值即为sum/len
+    }
+    res.toArray // 最后需要转换为Array，return关键字可以省略
+  }
+}
+```
 
 # 429.N叉树的层序遍历