From e48336238d25eac775f1897ad85b9be551ba1e69 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=99=88=E6=A2=A6=E6=B4=81?= <3224935686@qq.com>
Date: Sun, 3 Apr 2022 14:03:31 +0800
Subject: [PATCH] =?UTF-8?q?=E4=BF=AE=E6=94=B9=E4=BA=8C=E5=8F=89=E6=A0=91?=
 =?UTF-8?q?=E7=B3=BB=E5=88=9719=20=E4=BB=8E=E4=B8=AD=E5=BA=8F=E4=B8=8E?=
 =?UTF-8?q?=E5=90=8E=E5=BA=8F=E9=81=8D=E5=8E=86=E5=BA=8F=E5=88=97=E6=9E=84?=
 =?UTF-8?q?=E9=80=A0=E4=BA=8C=E5=8F=89=E6=A0=91JS=E7=89=88=E6=9C=AC?=
 =?UTF-8?q?=E5=8F=98=E9=87=8F=E5=90=8D=20preorder->inorder?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0106.从中序与后序遍历序列构造二叉树.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/problems/0106.从中序与后序遍历序列构造二叉树.md b/problems/0106.从中序与后序遍历序列构造二叉树.md
index 496de431..7ecca773 100644
--- a/problems/0106.从中序与后序遍历序列构造二叉树.md
+++ b/problems/0106.从中序与后序遍历序列构造二叉树.md
@@ -790,7 +790,7 @@ func findRootIndex(target int,inorder []int) int{
 
 ```javascript
 var buildTree = function(inorder, postorder) {
-    if (!preorder.length) return null;
+    if (!inorder.length) return null;
     const rootVal = postorder.pop(); // 从后序遍历的数组中获取中间节点的值， 即数组最后一个值
     let rootIndex = inorder.indexOf(rootVal); // 获取中间节点在中序遍历中的下标
     const root = new TreeNode(rootVal); // 创建中间节点