B Trees

Why Do We Use B Trees?

• B trees make trees shallower by decreasing the number of levels in a tree
• B trees increase the number of values stored in each node
• B trees increase the number of children for each node
• The goal is to keep the number of memory operations lower, as memory operations can be slow

B Tree Properties

1. They are search trees with ordered children and values
2. They are self balancing
3. They grow from the root upwards
4. Insertions are only into leaf nodes

To learn more about B-Trees, visit: Introduction of B Tree