\paragraph{B-Tree}
In B-Trees of order $k$, each node (except the root) has between $k \div 2$ and $k$ child nodes.
The root node has at least two children, unless it is also a leaf and any non-leaf node contains at exactly $k - 1$ keys.

Even if database systems say they use B-Trees, they do in fact use B+ trees.
