0 votes 0 votes Databases made-easy-test-series databases b-tree + – vaishali jhalani asked Jan 26, 2017 edited Mar 5, 2019 by adeebafatima1 vaishali jhalani 575 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Gate Mission 1 commented Jan 26, 2017 reply Follow Share is it 4 ? 0 votes 0 votes vaishali jhalani commented Jan 26, 2017 reply Follow Share Ans given is 5. How you are calculating 0 votes 0 votes Gate Mission 1 commented Jan 26, 2017 i edited by Gate Mission 1 Jan 26, 2017 reply Follow Share ---------EDIT for max level Let x = ceil (p/2) = 3 At level 1, min keys can be 1 At level 2, min keys can be 2(x-1) [as no of nodes at this level are 2] At level 3, min keys can be 2x(x-1) [as no nodes at this level are 2x ] So upto level L min keys are = 1 + 2(x-1) [1 + x + x2 + ........+xl-2 ] => 1 + 2(x(l-1) -1) >= 300...solving further gives l = 5 0 votes 0 votes vaishali jhalani commented Jan 26, 2017 reply Follow Share They are saying max level...i think we have to consider the minimum order at every node 1 votes 1 votes vaishali jhalani commented Jan 26, 2017 reply Follow Share According to you...no of levels should be 6 as we consider root at level 1. 0 votes 0 votes Please log in or register to add a comment.