From a395f6f9dfec9fd4c0a4ab560091beac5785cbfc Mon Sep 17 00:00:00 2001
From: hailincai <hailin.cai.neulion@gmail.com>
Date: Fri, 13 Aug 2021 14:57:54 -0400
Subject: [PATCH] =?UTF-8?q?Update=200102.=E4=BA=8C=E5=8F=89=E6=A0=91?=
 =?UTF-8?q?=E7=9A=84=E5=B1=82=E5=BA=8F=E9=81=8D=E5=8E=86.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Add Java implementation for leetcode 116
---
 problems/0102.二叉树的层序遍历.md | 29 +++++++++++++++++++++++
 1 file changed, 29 insertions(+)

diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index 007eac44..0f9b2df6 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -1205,6 +1205,35 @@ public:
 };
 ```
 
+java代码：
+
+```java
+class Solution {
+    public Node connect(Node root) {
+	Queue<Node> tmpQueue = new LinkedList<Node>();
+	if (root != null) tmpQueue.add(root);
+		
+	while (tmpQueue.size() != 0){
+	    int size = tmpQueue.size();
+            
+            Node cur = tmpQueue.poll();
+            if (cur.left != null) tmpQueue.add(cur.left);
+            if (cur.right != null) tmpQueue.add(cur.right);
+            
+	    for (int index = 1; index < size; index++){
+		Node next = tmpQueue.poll();
+		if (next.left != null) tmpQueue.add(next.left);
+		if (next.right != null) tmpQueue.add(next.right);
+                
+                cur.next = next;
+                cur = next;
+	    }
+	}
+        
+        return root;
+    }
+}
+```
 
 python代码：