Question

Maximum height of a b+ tree of order m with n key values is

Answer 1

Answer:

Explanation:

The minimum number of keys per record is 1/2 of the maximum number of keys. For example, if the order of a B+ tree is n, each node (except for the root) must have between n/2 and n keys. The number of keys that may be indexed using a B+ tree is a function of the order of the tree and its height.

Answer 2

Explanation:

For example, if the order of a B+ tree is n, each node (except for the root) must have between n/2 and n keys. The number of keys that may be indexed using a B+ tree is a function of the order of the tree and its height. For a n-order B+ tree with a height of h: maximum number of keys is.