Maximum height of a B+ tree of order m with n key values is :

A log m(n)

B (m+n)/2

C log_m/2(m+n)

D log_(1/2m)(n+1/2)

Answer & Explanation
Option: [D]

Take Mock Tests

Government Schemes Mock Test	Start Test!
Political Science Mock Test – 42	Start Test
History Test – 190	Start Test
Quantitative Aptitude Test	Start Test!
Trigonometry - Mock Test	Start Test!
Data Interpretation - Mock Test	Start Test!
General Awareness - Mock Test	Start Test!
Reasoning Ability - Mock Test	Start Test!
Englist(Antonyms) Mock Test 1	Start Test!
Quantitative Aptitude (Percentage) Mock Test	Start Test!
Economy Mock Test 1	Unlock Test!
Books & Authors - Test 2	Unlock Test!