A balanced tree structure where each node can have multiple children

• Useful for Database systems since disk I/O is proportional to the tree height
• Each node contains multiple data points, ex. each node could have 4 values
  • Then each child would contain 4 values that sit between the values of the root

Insertion

• Once you insert, if the node is too big (>4 in this example), split it up into two nodes and push the extra node to the parent. If the parent is too big, repeat