B+-tree Balanced All data are in the leaf nodes Leaf nodes have keys and data pointers Internal nodes contain keys and child pointers Keys dene range of values for children Often siblings are connected by pointers to avoid parent traversal