GATE | GATE CS 1999 | Question 69

[5 Marks question]

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, h≥1. (Assume that the root of a tree is at height 0.)


Answer:

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save