Q. What is the best case height of a B-tree of order n and which has k keys? (Solved)

1. logn (k+1) – 1

2. nk

3. logk (n+1) – 1

4. klogn

  • a. logn (k+1) – 1

Related Topics

Subscribe Now

Get All Updates & News