简体繁体 English

B +树创建

[英]B+ Tree creation

原文 2014-04-29 17:10:16 4 1 data-structures/ tree

I am trying to understand B+ trees. 我正在尝试了解B +树。 I have done some reading about it. 我已经读了一些。
One thing I am confused about. 一件事让我感到困惑。 For creation of tree some articles give no. 对于树的创建，有些文章不提供。 of keys=n, no. 键数= n，不。 of pointers=1+n and some increase them by 1. 的指针= 1 + n，有的则将其增加1。

For example I have to make a B+ tree of order 3 with 例如，我必须制作一个3阶的B +树
6,2,9,16,12,17,21,18 6,2,9,16,12,17,21,18

Here the root shall have 3 numbers and 4 pointers OR 4 numbers and 5 pointers. 这里的根应该有3个数字和4个指针，或者4个数字和5个指针。

1 个解决方案

The order measures the branching factor, or the maximum number of keys. 该顺序测量分支因子或最大键数。 When the root is alone it has one pointer, to its own key. 当根单独存在时，它只有一个指向其自身密钥的指针。 Once more nodes are added it will have 1 pointer to its key and then n pointers to its children, where n is the order of the tree. 一旦添加了更多节点，它将有1个指向其键的指针，然后有n个指向其子节点的指针，其中n是树的顺序。 In this case the B+ tree root will have one pointer to number ( key ) and up to 3 pointer to node. 在这种情况下，B +树的根将有一个指向数字（ key ）的指针，最多有3个指向node的指针。 for a total of 4 pointers. 总共有4个指针。