Question

In a B⁺ tree, if the search – key value is 8 bytes long, the block size is 512 bytes and the block pointer size is 2 bytes, then maximum order of the B⁺ tree is ____.

Answer 1

Correct answer is 52

Let ‘K’ be the order

K(2) + (K-1) (8) ≤ 512

⇒ 2K + 8k - 8  ≤ 512 

⇒ 10K ≤ 520K ⇒ K ≤ 520/10

∴ K ≤ 52