Log In
1 vote
In case of B Trees we split a node on insertion in case of overflow,

is there any possible case in which this may lead to underflow also? as a key is promoted to parent the children formed may have subtrees, which may be broken such that we get underflow somewhere?

just a thought
in Databases 163 views

1 Answer

0 votes

i think it is not possible ……

under possible when we perform deletion and over flow perform when we perform insertion …………

@Shaik Masthan  Sir please give your opinion

Related questions

1 vote
1 answer
Please Solve this question. I didn't understood the question properly so please Make Me as well :) What is meant by Leaf Page ?
asked Jun 29, 2018 in Databases Na462 271 views
1 vote
0 answers
Que1 Que 2 B and B+ trees always confused me in mock tests... here i m posting 2 of the ques from that topic... can someone just demonstrat the resultant tree after execution in both of the above que... please help..
asked Feb 7, 2017 in Databases S Ram 150 views
3 votes
0 answers
Can anybody explain what is meant by "Minimum Space Utilization"?
asked Jan 16, 2018 in Databases vishal chugh 90 views
0 votes
1 answer
Going with the definition, that order of a B+ tree is the maximum number of children a node can have. What is exactly meant by the order of a leaf node? As per my understanding order of a leaf node is the number of <key,pr> pairs it can hold. But in general when ... the upper limit on keys should be 5 and not 4. Could someone explain why its taken to be n-1 in every B+ tree insertion tutorial.
asked Dec 19, 2017 in Databases Shiwam1994 637 views