0 votes 0 votes Consider a B+ -tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a non-root node? What will be the same in a B-Tree Please also refer the source from where clear-cut formulae are given Databases b-tree databases + – Subham Nagar asked Dec 15, 2018 Subham Nagar 500 views answer comment Share Follow See 1 comment See all 1 1 comment reply Lakshman Bhaiya commented Dec 15, 2018 reply Follow Share see this https://stackoverflow.com/questions/870218/differences-between-b-trees-and-b-trees https://www.geeksforgeeks.org/b-tree-set-1-introduction-2/ 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes Number of Keys Present in Internal Nodes of Both B and B+ Trees are govern by the Formula [ Ceil( p/2 ) - 1 to p-1 ] , where p is the Order of the Tree. And For the root the formula is :[1, p-1] Solution of the Question: Given that p-1 =11 , so p=12. Hence the Order of the B+ tree is 12 Applying the Formula : [ Ceil( 12/2 ) - 1 to 12-1 ] , answer turn out to be: [5,11] So the Minimum number of keys Present will be 5 pradeepchaudhary answered Dec 22, 2018 pradeepchaudhary comment Share Follow See all 0 reply Please log in or register to add a comment.