UGC NET CSE | October 2022 | Part 1 | Question: 18

Question

Consider a B-tree of height h. minimum degree $t \geq 2$ that contains any $\mathrm{n}$-key, where $n \geq 1$. Which of the following is correct?

• A. $h \geq \log _{t} \frac{n+1}{2}$
• B. $h \leq \log _{t} \frac{n+1}{2}$
• C. $h \geq \log _{t} \frac{n-1}{2}$
• D. $h \leq \log _{t} \frac{n-1}{2}$

Comments

Kindly explain sir

---

Directly asked from CLRS chap 18 theorem 

 

---

Thank you so much sir