B+Tree Foundations Checkpoint

1. Why do database indexes usually use B+Trees instead of ordinary binary search trees?

B+Trees reduce tree height by storing many sorted keys per page B+Trees make every operation O(1) B+Trees avoid comparisons entirely B+Trees store only unsorted hash buckets

2. In the B+Tree model used in this module, actual key/value records live in:

Leaves Internal nodes The root only Both leaves and internal nodes

3. True/False: Internal separator keys must be sorted.

4. A larger internal fanout usually means:

Fewer levels for the same number of rows More levels for the same number of rows No effect on height The tree becomes a linked list