B-Tree Example with m = 5

2

3

8

12

13

27

The root has been 2 and m children.

Each non-root internal node has between ?m/2? and m children.

All external nodes are at the same level. (External nodes are actually represented by null pointers in implementations.)

Previous slide

Next slide

Back to first slide

View graphic version