返回主题:存储常用数据结构

此卡片不在当前主题的阅读序列中,可返回主题继续阅读。

知识卡片

普通读书笔记卡 · 3633.a.8

最小度约束节点键数

理解等级:中级

B 树最小度 t≥2;

  • 非根节点至少有 t−1 个键,
  • 内部非根节点至少 t 个孩子,
  • 节点最多有 2t−1 个键。

根作为例外,非空时至少一个键。这些上下界同时限制稀疏和过满节点。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第18章 B树 · 查看原书依据

      Every node other than the root must have at least t − 1 keys. Every internal node other than the root thus has at least t children. If the tree is nonempty, the root must have at least one key. b. Every node may contain at most 2t − 1 keys. Therefore, an internal node may have at most 2t children.

    参考来源

    - 位置:《算法导论(第4版)》第18章《B树》(OEBPS/chapter018.xhtml,文本字符[10000,15000))。 - 结论依据:原文按最小度给出非根节点和根的键数边界、满节点定义。 - 原始内容:Every node other than the root must have at least t − 1 keys. Every internal node other than the root thus has at least t children. If the tree is nonempty, the root must have at least one key. b. Every node may contain at most 2 t − 1 keys. Therefore, an internal node may have at most 2 t children.