Question: A B + - tree index file has 1 0 0 , 0 0 0 entries ( search key values ) and maximum fanout of
A B tree index file has entries search key values and maximum fanout of n The maximum height of the tree will be
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
