From 64305f520db7634a24163574d287d96a88e47471 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=B2=A9=E5=B2=A9?=
 <68364461+oxyanyano@users.noreply.github.com>
Date: Tue, 29 Mar 2022 11:58:30 +0800
Subject: [PATCH] =?UTF-8?q?Update=207.6B+=E6=A0=91.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 7.6B+树.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/7.6B+树.md b/7.6B+树.md
index e22af5d..94efd0a 100644
--- a/7.6B+树.md
+++ b/7.6B+树.md
@@ -13,9 +13,9 @@ B树任何一层都可以找到，因为每一层都是数据
 
 B+树有两种查找方式：①分块查找：从根结点查 ②顺序查找：从P开始横着查。
 
-![uTools_1638279630033](F:\408数据结构\图片\uTools_1638279630033.png)
+![uTools_1638279630033](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/uTools_1638279630033.png)
 
-![uTools_1638279791118](F:\408数据结构\图片\uTools_1638279791118.png)
+![uTools_1638279791118](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/uTools_1638279791118.png)
 
 ### 二、B+树的实现
 
@@ -37,4 +37,4 @@ B+树有两种查找方式：①分块查找：从根结点查 ②顺序查找
 
 ### 六、B树与B+树的对比
 
-![1638280509471](F:\408数据结构\图片\1638280509471.jpg)
+![1638280509471](https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes/blob/main/images/1638280509471.jpg)