B-tree indices
------------------

A node in a B-tree -> A disk page


Leaf nodes: Point to tuples

Internal nodes: Point to index nodes below



B-tree of order n

Leaf nodes: max n tuples + 1 sibling pointer // min: n/2 (nodes to be half full)

Internal nodes: max n+1 pointers , n key values// min: floor((n+1)/2)
pointers and 1 less key

Exception root: Min: 2 pointers and 1 key value


Searching a B-tree

N=6