2 votes 2 votes Consider a B+ tree with order 15, what is the max no of records that can be indexed with 3 levels ? Databases b-tree databases + – cse23 asked Jun 20, 2016 • retagged Nov 21, 2016 by Kapil cse23 1.3k views answer comment Share Follow See all 21 Comments See all 21 21 Comments reply Show 18 previous comments ManojK commented Nov 21, 2016 reply Follow Share yes .should be mentioned explicitly. 1 votes 1 votes pC commented Dec 25, 2016 reply Follow Share If nothing is mentioned explicitly we can consider this , right ? The height of a node is the number of edges on the longest path from the root node to a leaf 0 votes 0 votes Kapil commented Dec 25, 2016 reply Follow Share If nothing is mentioned, we consider root = 0 But, Navathe says a 3 level B tree is root + 3 levels and not root + 2 levels. But root + 3 levels is actually 4 levels :P 1 votes 1 votes Please log in or register to add a comment.
3 votes 3 votes In B+ tree all records would present at leaf so at 3rd level all records would be present here maximum Number of records that could be present at 3rd level =15*15*14 =3150 So that maximum records would be 3150 shivanisrivarshini answered Jun 20, 2016 shivanisrivarshini comment Share Follow See all 0 reply Please log in or register to add a comment.
