B-tree

Every node has at most m children, and every node has at least m/2 children. This is known as binary.

This is the maximum number of potential search keys for each node in a B-tree.

4 is the maximum, so you have the root.

This is expansion. Therefore, your computer need to optimize your huge data.

This is back and forth.