Define B-tree Of Order M?

1.	Define B-tree Of Order M?
Answer» A B-TREE of ORDER M is a tree that is not binary with the following structural PROPERTIES: The ROOT is either a leaf or has between 2 and M children. All non-leaf nodes (EXCEPT the root) have between [M/2] and M children. All leaves are at the same depth. A B-tree of order M is a tree that is not binary with the following structural properties:

Answer»

A B-TREE of ORDER M is a tree that is not binary with the following structural PROPERTIES:

A B-tree of order M is a tree that is not binary with the following structural properties:

Discussion