Database-Management-System

Question 35

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.)

A
Theory Explanation.
Correct Answer: A
0 0 votes
Article Rating
Subscribe
Notify of


0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: <b>Alert: </b>Content selection is disabled!!
Computer-Networks
October 9, 2023
UGC NET Dec-2020 and June-2021 Paper-2
October 9, 2023
Computer-Networks
October 9, 2023
UGC NET Dec-2020 and June-2021 Paper-2
October 9, 2023