The upper bound and lower bound for the number of leaves in a B-Tree of degree K with height h is given by:
A. Kh and 2ΓK/2˥h-1
B. K*h and 2ʟK/2˩h-1
C. Kh and 2ʟK/2˩h-1
D. K*h and 2ΓK/2˥h-1
Answer:A
The upper bound and lower bound for the number of leaves in a B-Tree of degree K with height h is given by:
A. Kh and 2ΓK/2˥h-1 B. K*h and 2ʟK/2˩h-1 C. Kh and 2ʟK/2˩h-1 D. K*h and 2ΓK/2˥h-1