mirror of
https://github.com/oxyanyano/2022-WangDao-CS-DS-Notes.git
synced 2026-05-12 02:56:55 +08:00
Update 7.6B+树.md
This commit is contained in:
@@ -13,9 +13,9 @@ B树任何一层都可以找到,因为每一层都是数据
|
||||
|
||||
B+树有两种查找方式:①分块查找:从根结点查 ②顺序查找:从P开始横着查。
|
||||
|
||||

|
||||

|
||||
|
||||

|
||||

|
||||
|
||||
### 二、B+树的实现
|
||||
|
||||
@@ -37,4 +37,4 @@ B+树有两种查找方式:①分块查找:从根结点查 ②顺序查找
|
||||
|
||||
### 六、B树与B+树的对比
|
||||
|
||||

|
||||

|
||||
|
||||
Reference in New Issue
Block a user