B-Tree Nodes
Internal node
i search keys; i+1 subtrees; M - i - 1 inactive entries
Leaf
j data keys; L - j inactive entries
1
2
M - 1
1
2
L
i
j
Previous slide
Next slide
Back to first slide
View graphic version