What is the best case height of a B-tree of order n and which has k keys? a) logn (k+1) – 1 b) nk c) logk (n+1) – 1 d) klogn
Answer: a Explanation: B-tree of order n and with height k has best case height h, where h = logn (k+1) – 1. The best case occurs when all the nodes are completely filled with keys.