Computer-Networks
October 9, 2023UGC NET Dec-2020 and June-2021 Paper-2
October 9, 2023Database-Management-System
|
Question 33
|
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.)
|
Theory Explanation.
|
Correct Answer: A
Subscribe
Login
0 Comments