Called "t" or "minimum degree" in litterature, can never be < 2.
Make it lower (eg: 2) to test tree algorithms.
See <digression> below to see why this is not B-Tree "order".
structBTree(K, V, alias less = "a < b", bool allowDuplicates = false, bool duplicateKeyIsUB = false)
Called "t" or "minimum degree" in litterature, can never be < 2. Make it lower (eg: 2) to test tree algorithms. See <digression> below to see why this is not B-Tree "order".