Computer Science · Database Systems
In an indexed database for historical stock quotes, a B-tree is used as the index structure to support range scans efficiently on disk, with each internal node holding multiple keys and child pointers. The branching factor ensures logarithmic height even for large datasets, making search, insert, and delete operations balanced at:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(log n)✓
- 2O(n)
- 3O(1)
- 4O(n log n)
Correct answer
O(log n)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Database Systems MCQs →Want more practice questions on Database Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Systems