What are the minimum numbers of keys and pointers in btree


What are the minimum numbers of keys and pointers in Btree (i) interior nodes and (ii) leaves, when:

a) n = 10; i.e., a block holds 10 keys and 11 pointeis.

b) n = 11; i.e., a block holds 11 keys and 12 pointers.

Solution Preview :

Prepared by a verified Expert
Basic Computer Science: What are the minimum numbers of keys and pointers in btree
Reference No:- TGS02927554

Now Priced at $10 (50% Discount)

Recommended (92%)

Rated (4.4/5)