How many elements can be held in a B-tree of order n?

Question

Is it 2n? Just checking.

Answer 1

My book says that the order of a B-tree is the maximum number of pointers that can be stored in a node. (p. 348) The number of "keys" is one less than the order. So a B-tree of order n can hold n-1 elements.

The book is "File Structures", second edition, by Michael J. Folk.