DSA Studio

Navigation and Range Scan Checkpoint

Search routing, equality boundaries, and range scan mechanics.

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

1. With separators [15,30] and equality routing right, key 15 goes to which zero-based child?

Select one answer.

2. Leaves are [1,4], [7,9], [12,16]. For inclusive range [5,12], which keys are returned?

Select one answer.

3. A leaf has [3,8,13]. For inclusive range [8,8], how many keys match?
4. A range scan reaches key 21 while its upper bound is 20. Can it stop in an ordered leaf chain?

Select one answer.

Join Discord