In a B-tree with a minimum degree t ≥ 2, what is the maximum number of keys that a single node can contain?

2t - 1

B-trees are balanced search trees designed for storage systems. Every node except the root must have at least t-1 keys, and every node can have at most 2t-1 keys to ensure the tree remains balanced during splits and merges.