retagged by
404 views
1 votes
1 votes
Assume that a B-Tree is used as an index for a large database table which has six levels (including the root node). If a new key is inserted into this index, then the maximum number of levels possible in the updated tree is ______.
retagged by

1 Answer

Best answer
1 votes
1 votes
lets take  all the node contain maximum no of keys which can be hold by them , now insert a key in the leaf node then the node will break in two node and transfer one of the key to the parent

but we know that the parent also have maximum keys so adding one key to them will split the node in to two node and one key will be  transfer to the its parent ,again same thing happen

at the end when the key will be inserted in the root node the root node will break and create a new parent which will contain only single key

so one level has been increased

so total level is 7
selected by
Answer:

Related questions

2 votes
2 votes
1 answer
3
Bikram asked Aug 26, 2017
431 views
The above ER diagram depicts a book rental scheme.If this ER diagram is mapped to a relational model, to correctly depict this above scenario, the total number of relatio...
3 votes
3 votes
2 answers
4
Bikram asked Aug 26, 2017
412 views
$\sigma_{A=B \text{ and } B=C \text{ and } C=A} \bigg( \Pi_A (R) \times \Pi_B (R) \times \Pi_C (R) \bigg)$The number of rows returned by the above relational algebraic ex...