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?
Check this out
https://en.wikipedia.org/wiki/B%2B_tree#Overview
64.3k questions
77.9k answers
244k comments
80.0k users