Definition of a B-Tree
A B-tree of order m is an m-way tree such that
All leaves are on the same level.
All internal nodes except the root are constrained to have at most m non empty children and at least m/2 non empty children.
The root has at most m non empty children.