•Parameter d = the degree
•Each node has >= d and <= 2d keys (except root)
•
•
•Each leaf has >=d and <= 2d keys:
B+ Trees Basics
240
120
30
Keys k < 30
Keys 30<=k<120
Keys 120<=k<240
Keys 240<=k
60
50
40
40
50
60
Next leaf