1.Previous
3.Next

of nodes: root, internal (a.k.a. interior), and leaf. In B+ trees, the following properties are maintained for these nodes:

* If exists in any node in a B+ tree, then exists in that node where .
* All leaf nodes have the same number of ancestors (i.e., they are all at the same depth).

The pointer properties of nodes are summarized in the tables below:

* : Maximum number of potential search keys for each node in a B+ tree. (this value is constant over the entire tree).
* : The pointer at the zero-based node

1.Previous
3.Next