Test by Bikram | Databases | Test 1 | Question: 24

Question

Let the search key field of a B+ tree is 4 Bytes , the disk block size is 199 Bytes , and the index pointer is 3 Bytes, then the order of B+ tree is _______

Answer 1

n*3 + (n-1)4 <=199 , n<=29 , so order is 29

Comments

sorry sir ,  it was typo i am saying it must be less than 29 every node need to sum additional information

am i not correct?

---

it is a B + tree so read B+ tree property once.

and see my given answer.

---

index pointer is tree pointer or node pointer. right?