consider a b+ tree in which the miximum number of keys in a node is 5 what is the minimum number of keys in any non-root node?
my doubt is tree has order 6. For internal Nodes min will be Math.ceil(6/2) -1 = 2 and for External (leaf) nodes, min keys will be Math.floor(6/2) = 3.
so whats the answer 2 or 3 ??