B-Trees

B-trees are a type of tree data strucutre where each node can store multiple values.

Properties

• Self-balancing: height grows in O(log N)
• All leaves are on the same level
• All internal nodes have a number of children equal to the number of values in the node + 1
• Insertions are only done at leaf nodes
• New levels are added from the root upwards

You can find out more about B-trees here