From f5c5a58b137adad5490c04b57f82953101789999 Mon Sep 17 00:00:00 2001
From: ZongqinWang <1722249371@qq.com>
Date: Thu, 19 May 2022 13:42:12 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=20111.=E4=BA=8C=E5=8F=89?=
 =?UTF-8?q?=E6=A0=91=E7=9A=84=E6=9C=80=E5=B0=8F=E6=B7=B1=E5=BA=A6=20Scala?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0102.二叉树的层序遍历.md | 24 +++++++++++++++++++++++
 1 file changed, 24 insertions(+)

diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index 95a6b5d6..b411816a 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -2403,6 +2403,30 @@ func minDepth(_ root: TreeNode?) -> Int {
 }
 ```
 
+Scala:
+```scala
+// 111.二叉树的最小深度
+object Solution {
+  import scala.collection.mutable
+  def minDepth(root: TreeNode): Int = {
+    if (root == null) return 0
+    var depth = 0
+    val queue = mutable.Queue[TreeNode]()
+    queue.enqueue(root)
+    while (!queue.isEmpty) {
+      depth += 1
+      val len = queue.size
+      for (i <- 0 until len) {
+        val curNode = queue.dequeue()
+        if (curNode.left != null) queue.enqueue(curNode.left)
+        if (curNode.right != null) queue.enqueue(curNode.right)
+        if (curNode.left == null && curNode.right == null) return depth
+      }
+    }
+    depth
+  }
+}
+```
 
 # 总结