From e3367b53320e757d119fe5d35552b2d4e53b260c Mon Sep 17 00:00:00 2001
From: QuinnDK <39618652+QuinnDK@users.noreply.github.com>
Date: Sun, 16 May 2021 16:47:45 +0800
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

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

diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index 9b5f9ed5..0ab67b13 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -657,8 +657,36 @@ Python：
 
 
 Go：
+```Go
+func levelOrder(root *TreeNode) [][]int  {
+	result:=make([][]int,0)
+	if root==nil{
+		return result
+	}
 
+	queue:=make([]*TreeNode,0)
+	queue=append(queue,root)
 
+	for len(queue)>0{
+		list:=make([]int,0)
+		l:=len(queue)
+
+		for i:=0;i<l;i++{
+			level:=queue[0]
+			queue=queue[1:]
+			list=append(list,level.Val)
+			if level.Left!=nil{
+				queue=append(queue,level.Left)
+			}
+			if level.Right!=nil{
+				queue=append(queue,level.Right)
+			}
+		}
+		result=append(result,list)
+	}
+	return result
+}
+```
 
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)