What is a good metric to pick the degree of a B-Tree? I assume this depends on the number of expected elements? Degree 2 gives us a 2-3-4 tree (each node contains 1-3 items and 2-4 children).How can I decide this? I am looking to store a couple of thousand keys in it.
What is a good metric to choose the degree of a B-Tree?
data structures;trees;search trees