b + TREE explain..??

Question

with respect to the B+ TREE index method .select the true statements?

1 records are physically stored in primary key order

2 B+ tree use a hashing algo.

3 the index tree may become unbalanced as a result of updates

4 none of the above

Answer 1

A is false..Clustering index on non key .

B is false (obviously B+ tree need not follow hashing function)..

C. true.

Take a B+ tree with  3 keys {1,2,3} and 2 is root.. now update root value to 10.. tree will be unbalanced..

Comments

tell??. wtever you know about (a) option..

---

sir, FOR multilevel indexing we use B or B+tree becoz these tree are height balanced tree ...sir than after some updates tree will get unbalanced but after that it will try to make it balanced na.??than how c option true...????????

---

But it will not remain unbalanced, it will rebalance itself. So answer should be $d$.