What is the best case height of a B-tree of order n and which has k keys?

M

Mr. Dubey

🎓 Coach ⭐ 104.72K Points

📊 Data Structure (DS)

Q. What is the best case height of a B-tree of order n and which has k keys?

(A) logn (k+1) – 1
(B) nk
(C) logk (n+1) – 1
(D) klogn

💬 Discuss

✅ Correct Answer: (A) logn (k+1) – 1

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

237

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

85%

Success Rate