# B-Tree

B-Tree又叫平衡多路查找树。

![](/files/-LDAno4Ktbxf9hBcqgEc)

## 特性

1. 数据项存储在树叶上
2. 非叶子节点存储直到M-1个关键字以指示搜索的方向
3. 树的根或者一片树叶，或者其儿子数在2和M之间
4. 除根外，所有非树叶节点的儿子数在【M/2】和M之间
5. 所有的树叶都在相同的深度上，并有【L/2】和L之间个数据项

M：M叉树，二叉树则M为二。


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://fup1990.gitbook.io/learn/shu-ju-jie-gou/b+tree.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.