I wanted to get a small clarification about B-trees
Lets say I chose a parameter k , k being the parameter defined in class
now, in every internal node i can put bitween k-1 and 2k-1 keys, by definition.
if a particular node has j children (k<j<2k) does that mean i have to put exactly j-1 kesy in this node ?
in other words could there be a situation that a node has a legal number of children between k and 2k but the number of keys is not k-1 but a larger number than k-1 and smaller than 2k-1 ?
I mean - is the number of keys in a node determined by the number of rhe nodes children minus one or only by k ?