Timeline for Confusion about B-Tree
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 16, 2022 at 22:38 | comment | added | Nathaniel | Please at least read the wikipedia article, it is well done so you will learn things about B-trees. | |
| Nov 16, 2022 at 22:37 | comment | added | Nathaniel | No, I mean that if $k$ is the number of children of a node, then the EXACT number of keys that node contains is ALWAYS $k-1$. Not any more or any less. | |
| Nov 16, 2022 at 22:26 | comment | added | Denis | You mean the maximum number of keys that a node can contain is one less than the number of children, but how about the minimum? | |
| Nov 16, 2022 at 22:24 | comment | added | Nathaniel | @ShinobiSan As I said, the number of keys is always one less than the number of children, so no, you do not have complete freedom. | |
| Nov 16, 2022 at 22:22 | comment | added | Denis | What do you mean by the number of children and not the number of keys? Does it mean that in a node there's no minimum on how many keys (elements) must be in it? Like it is legal for any node to have any number of elements ranging from 1 to m-1? | |
| Nov 16, 2022 at 22:17 | history | answered | Nathaniel | CC BY-SA 4.0 |