DSA Studio

B+Tree Foundations Checkpoint

Page thinking, fanout, separators, and leaf storage.

Get every question correct to pass this checkpoint. You can review feedback, revise your answers, and submit again.

1. An internal page fits 100 child pointers. Roughly how many child ranges can two internal levels address before leaves?

Select one answer.

2. An internal separator equals a key still stored in a leaf. Is that necessarily a duplicate user record?

Select one answer.

3. Can a valid balanced B+Tree have one leaf at depth 2 and another at depth 4?
4. For a range spanning several leaves, which structure avoids a new root descent for each leaf?

Select one answer.

Join Discord