Computer Science · Data Structures
Consider a B-tree of height h with a minimum degree t ≥ 2 that contains n keys, where n ≥ 1. Which of the following bounds is correct regarding the height h?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1h ≤ logt(n-12)
- 2h ≥ logt(n-12)
- 3h ≤ logt(n+12)✓
- 4h ≥ logt(n+12)
Correct answer
h ≤ logt(n+12)
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 Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures