Multiple ChoiceIntermediate 30s
A B-tree is optimized for
Choose the best answer for: A B-tree is optimized for
Options
- 1Graph traversal over adjacency lists
- 2In-memory operations with small nodes
- 3Disk access with large branching factor
- 4Storage of variable length strings
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.