Discussion
Maximum height of a B+ tree of order m with n key values is
Answer: D
Correct answer: None of these
In a B+ tree of order m each node holds at least \( \lceil m/2 \rceil \) pointers, so the height is bounded by
\[ h \le \log_{\lceil m/2 \rceil}(n) \]
The base is \( \lceil m/2 \rceil \), not m - the minimum fill, since the worst case is the sparsest tree. None of the three expressions offered has that form.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development