Question

Which B+ tree characteristic is particularly useful for a range query such as salary BETWEEN 50000 AND 70000?

A Leaf nodes are typically linked, allowing sequential traversal across the key range.
B Internal nodes contain complete table rows, eliminating all leaf accesses.
C Every key is stored only once, making equality and range queries identical.
D The tree avoids ordering keys so insertion and range scans use the same path.
E Range queries scan every internal node independently.
Practice Next

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)