From be7d6e1325009d5f404c8abeaae0cbed49ed2303 Mon Sep 17 00:00:00 2001
From: ZongqinWang <1722249371@qq.com>
Date: Fri, 20 May 2022 19:36:10 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200226.=E7=BF=BB=E8=BD=AC?=
 =?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=A0=91.md=20Scala=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0226.翻转二叉树.md | 48 ++++++++++++++++++++++++++++++++
 1 file changed, 48 insertions(+)

diff --git a/problems/0226.翻转二叉树.md b/problems/0226.翻转二叉树.md
index a3ebe24d..e378cbc1 100644
--- a/problems/0226.翻转二叉树.md
+++ b/problems/0226.翻转二叉树.md
@@ -820,5 +820,53 @@ func invertTree(_ root: TreeNode?) -> TreeNode? {
 }
 ```
 
+### Scala
+
+深度优先遍历（前序遍历）:
+```scala
+object Solution {
+  def invertTree(root: TreeNode): TreeNode = {
+    if (root == null) return root
+    // 递归
+    def process(node: TreeNode): Unit = {
+      if (node == null) return
+      // 翻转节点
+      val curNode = node.left
+      node.left = node.right
+      node.right = curNode
+      process(node.left)
+      process(node.right)
+    }
+    process(root)
+    root
+  }
+}
+```
+
+广度优先遍历（层序遍历）:
+```scala
+object Solution {
+  import scala.collection.mutable
+  def invertTree(root: TreeNode): TreeNode = {
+    if (root == null) return root
+    val queue = mutable.Queue[TreeNode]()
+    queue.enqueue(root)
+    while (!queue.isEmpty) {
+      val len = queue.size
+      for (i <- 0 until len) {
+        var curNode = queue.dequeue()
+        if (curNode.left != null) queue.enqueue(curNode.left)
+        if (curNode.right != null) queue.enqueue(curNode.right)
+        // 翻转
+        var tmpNode = curNode.left
+        curNode.left = curNode.right
+        curNode.right = tmpNode
+      }
+    }
+    root
+  }
+}
+```
+
 -----------------------
 <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>