Splits, Validation, and Bulk Loading Checkpoint

1. A leaf split promotes:

The first key of the right leaf The last key of the left leaf A key removed from both leaves No key

2. An internal split promotes:

The middle separator key The first key of the right leaf The smallest key in the whole tree The largest key in the leftmost child

3. True/False: All leaves in a valid B+Tree are at the same depth.

4. Bulk loading from sorted input is usually faster than repeated random inserts because it:

Builds mostly full leaf pages and parents bottom-up Avoids storing keys Turns the B+Tree into a hash index Requires no sorted order

5. A strong validator for this module should catch:

Broken leaf Next links Only syntax errors Only duplicate Go imports Only missing comments