B Trees

Question

 

Which of the following statement true about B tree and B⁺ tree index? Assume order of B tree node same as order of B⁺ tree node.

• B tree index has more levels than B⁺ tree index for large number of keys.
• B⁺ tree index has more levels than B tree index for large number of keys.
• Both B tree B⁺ tree best for sequential access of records.
• B⁺ tree index nodes more than B⁺ tree for large number of keys.

Answer 1

answer is (b). Since we are assuming that the order of B and B+ is the same, so each node of b tee and b+ tree both, will contain same number of keys.Now b+ tree will have to contain repeated keys in internal nodes so no. of levels will increase for b+ tree. Had the order not  been the same, we could have assumed higher fan out of b+ tree increasing breadth and decreasing height and in that case B tree would have larger number of levels than B+ tree

Comments

Ayushi Shrivastava okk we are about internal node but in b tree also we have key pointer and record pointer there but record pointer at last level only in b+ tree i think both should be same

---

https://gateoverflow.in/244489/made-easy-test-series see also there

Answer 2

Is answer is B, and please correct option d,  

indexing nodes is more in B+ bz it holds key value both in internal as well as leaf while B only has one entry for one key, rest for record pointer it is constant in both cases.

Comments

i dont know about d but option a is correct because b+ tree has more fan outs than b tree so level are less in b+ tree.

 in option d i think there s typing mistake.