Technology Sharing

한어Русский языкEnglishFrançaisIndonesianSanskrit日本語DeutschPortuguêsΕλληνικάespañolItalianoSuomalainenLatina

👋 Hi, I’m @Beast Cheng
👀 I’m interested in photography, hiking, landscape…
🌱 I’m currently learning python, javascript, kotlin…
📫 How to reach me --> [email protected]

---

喜欢《数据结构》部分笔记的小伙伴可以订阅专栏，今后还会不断更新。🧑‍💻
感兴趣的小伙伴可以点一下订阅、收藏、关注！🚀
谢谢大家！🙏

Examining some conceptual stuff

Comparison: Block Search

07-7.2.3 Block search[[7.2.3 Block search]]

definition

A B+ tree of order m must meet the following conditions:

1. Each branch node has at most m subtrees (child nodes)
2. A non-leaf root node has at least two subtrees, and each other branch node has at least $(m/2)$ Tree
3. The number of subtrees of a node is equal to the number of keywords
4. allLeaf nodes contain all keywordsand pointers to corresponding records. The keywords are arranged in order of size in the leaf nodes, andAdjacent leaf nodes are connected to each other in order of size(That is, it supports sequential search)
   In a B+ tree, regardless of whether the search is successful or not, you must eventually reach the bottom node.