B-tree of order m is a multiway search tree in which:The root has at least two subtrees unless it is the only node in the tree.Each nonroot and each nonleaf node have at most m nonempty children and at least m/2 nonempty children.The number of keys in each nonroot and each nonleaf node is one less than the number of its nonempty children.All leaves are on the same level.