添加 116.填充每个节点的下一个右侧节点指针 Scala版本

problems/0102.二叉树的层序遍历.md

@@ -1718,6 +1718,35 @@ func connect(_ root: Node?) -> Node? {
 }
 ```
 
+Scala:
+```scala
+// 116.填充每个节点的下一个右侧节点指针
+object Solution {
+  import scala.collection.mutable
+
+  def connect(root: Node): Node = {
+    if (root == null) return root
+    val queue = mutable.Queue[Node]()
+    queue.enqueue(root)
+    while (!queue.isEmpty) {
+      val len = queue.size
+      val tmp = mutable.ListBuffer[Node]()
+      for (i <- 0 until len) {
+        val curNode = queue.dequeue()
+        tmp.append(curNode)
+        if (curNode.left != null) queue.enqueue(curNode.left)
+        if (curNode.right != null) queue.enqueue(curNode.right)
+      }
+      // 处理next指针
+      for (i <- 0 until tmp.size - 1) {
+        tmp(i).next = tmp(i + 1)
+      }
+      tmp(tmp.size-1).next = null
+    }
+    root
+  }
+}
+```
 # 117.填充每个节点的下一个右侧节点指针II
 
 [力扣题目链接](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii/)