Consider a B-tree with degree m, that is, the number of children c of any…
PYQ GATE 1999
Consider a B-tree with degree m, that is, the number of children c of any internal node (except the root) is such that m ≤ c ≤ 2m − 1. Derive the maximum and minimum number of records in the leaf nodes for such a B-tree with height h ≥ 1. (Assume that the root of the tree is at height 0.)
Attempted by 1 students.
Sign up free to check your answer
Sign up freeLoading lesson…

