B-tree
Node structure

As with other trees, B-trees can be represented as a collection of three types of nodes: root, internal (a.k.a. interior), and leaf.

Note the following variable definitions:

In B-trees, the following properties are maintained for these nodes:

Each internal node in a B-tree has the following format:

Each leaf node in a B-tree has the following format:

The node bounds are summarized in the table below:
detectable_content:number_placeholders[7]