For a node of the B+ tree, not the root and not a leaf, the fill factor of at least 50% usage has to do with the keys OR with the pointers?
I remind you that if a node has for example k keys, then it has k+1 pointers.
For a node of the B+ tree, not the root and not a leaf, the fill factor of at least 50% usage has to do with the keys OR with the pointers?
I remind you that if a node has for example k keys, then it has k+1 pointers.
Code - functions and small libraries I use
It’s 2014 and I still use printf() for debugging.
"Programs must be written for people to read, and only incidentally for machines to execute. " —Harold Abelson
The answer is the pointers.
Code - functions and small libraries I use
It’s 2014 and I still use printf() for debugging.
"Programs must be written for people to read, and only incidentally for machines to execute. " —Harold Abelson