From a2bdb8e2b6d150c8abc87da297102a404e90400c Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E7=8E=98=E7=8F=9E?=
 <49714834+qiliq@users.noreply.github.com>
Date: Wed, 17 Jul 2024 19:07:59 +0800
Subject: [PATCH] Update tree.md
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

修改完全二叉树的描述，便于理解
---
 docs/cs-basics/data-structure/tree.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/cs-basics/data-structure/tree.md b/docs/cs-basics/data-structure/tree.md
index 9727359c..de9c6eb6 100644
--- a/docs/cs-basics/data-structure/tree.md
+++ b/docs/cs-basics/data-structure/tree.md
@@ -50,7 +50,7 @@ tag:
 
 ### 完全二叉树
 
-除最后一层外，若其余层都是满的，并且最后一层或者是满的，或者是在右边缺少连续若干节点，则这个二叉树就是 **完全二叉树** 。
+除最后一层外，若其余层都是满的，并且最后一层是满的或者是在右边缺少连续若干节点，则这个二叉树就是 **完全二叉树** 。
 
 大家可以想象为一棵树从根结点开始扩展，扩展完左子节点才能开始扩展右子节点，每扩展完一层，才能继续扩展下一层。如下图所示：