0 votes 0 votes if p:order of the internal of b+ tree which represents the maximum number of child pointer that the internal node can have then the minimum number of keys possible in the internal node is (ceil(p/2)-1) doubt: if q:order of the leaf node in the b+ tree which represents the maximum number of (key,value) pointer pairs present in the leaf node then what is the minimum number of keys possible in the leaf node? utpal podder asked Sep 18, 2018 utpal podder 449 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes If the order of a leaf node q of a B+ tree is defined as the maximum number of <key,pointer> pairs, then the minimum number of <key,pointer> pairs that can be present in the leaf node is ceil(q/2). Somoshree Datta 5 answered Sep 18, 2018 Somoshree Datta 5 comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments utpal podder commented Sep 18, 2018 reply Follow Share Can you provide the link where you get that expression. ... 0 votes 0 votes utpal podder commented Sep 18, 2018 reply Follow Share Are you getting that expression in any standard book? 0 votes 0 votes Somoshree Datta 5 commented Sep 19, 2018 reply Follow Share Check this out https://en.wikipedia.org/wiki/B%2B_tree#Overview 0 votes 0 votes Please log in or register to add a comment.