From d232e0f20eba5435417159e6c4bde0c91d93c052 Mon Sep 17 00:00:00 2001
From: xll <18574553598@163.com>
Date: Fri, 21 May 2021 09:50:39 +0800
Subject: [PATCH] =?UTF-8?q?0102=E4=BA=8C=E5=8F=89=E6=A0=91=E7=9A=84?=
 =?UTF-8?q?=E5=B1=82=E5=BA=8F=E9=81=8D=E5=8E=86javascript=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index 1cb4164f..22d4e5e5 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -79,6 +79,35 @@ public:
         return result;
     }
 };
+```
+javascript代码：
+
+```javascript
+var levelOrder = function(root) {
+    //二叉树的层序遍历
+    let res=[],queue=[];
+    queue.push(root);
+    if(root===null){
+        return res;
+    }
+    while(queue.length!==0){
+        // 记录当前层级节点数
+        let length=queue.length;
+        //存放每一层的节点 
+        let curLevel=[];
+        for(let i=0;i<length;i++){
+            let node=queue.shift();
+            curLevel.push(node.val);
+            // 存放当前层下一层的节点
+            node.left&&queue.push(node.left);
+            node.right&&queue.push(node.right);
+        }
+        //把每一层的结果放到结果数组
+        res.push(curLevel);
+    }
+    return res;
+};
+
 ```
 
 **此时我们就掌握了二叉树的层序遍历了，那么如下五道leetcode上的题目，只需要修改模板的一两行代码（不能再多了），便可打倒！**