Search Trees that have a degree ≥2 (maximum # of children)
Access and insertion similar to BSTs
Obey BST order property
Different B-Trees can have different degrees:
Degree m is the maximum number of children beneath any node.
-> Efficient access for a chunk of data
B-Trees with a degree of 4
2-3-4 denotes the number of children a node can have
Important: we only add values to the bottom of the tree i.e. only in leaf nodes.
On the way down to the leaf node that you are inserting a value into, split any node that you step through which is full.
This helps ensure that there is always space in the parent of any potentially split child node to hold one more value.
The parent node can never be full:
You may find more information here.