B+Tree Checkpoint

1. In a B+Tree, actual records live in:

Leaves Internal nodes Root only Both leaves and internal nodes

2. A leaf split promotes:

First key of the right leaf Last key of the left leaf Middle key removed from both No key

3. True/False: Leaf links enable efficient range scans.