B Tree
All leaves of B-tree are at the same level.
A B-tree of order m can have at most m-1 keys and m children.
Every node in B-tree has at most m children.
Root node must have at least two nodes.
Every node except the root node and the leaf node contain m/2 children