Answer
Giving an upper bound and a lower bound for the number
of leaves in a B-tree of degree k with height h.
Work Step by Step
Upper bound: k^h;
lower bound: 2 [k /2 ]^ h−1
Discrete Mathematics and Its Applications, Seventh Edition
by Rosen, Kenneth
Published by
McGraw-Hill Education
ISBN 10:
0073383090
ISBN 13:
978-0-07338-309-5
Chapter 11 - Section 11.5 - Minimum Spanning Trees - Supplementary Exercises - Page 805: 11
Update this answer!
You can help us out by revising, improving and updating this answer.
Update this answerAfter you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.
