since,normally when order = m then in b-trees atmose m-1 keys are stored in nodes and thre can be atmost m tree pointers and hence,formula is
m-1*(key value + record pointer ) + m*block pointer < block size.
but here,it is given that for order P,a nodecan have maximum 2P keys,
hence should it be 2P*(key value + record pointer ) + (2p+1)*block pointer < block size.//as there can be 2P keys,hence 2p+1 tree pointers
is this correct??
and for b+ trees,for internal node-
2P(key value) + 2P*(block pointer) <block sizze as internal nodes have no record pointers.
please correct me @pC