B tree and B+ tree

Question : What is difference between B tree and B⁺   tree? Why a B⁺   tree is a better tree structure than a B tree for implementation of an indexed sequential file.

Ans:

In a B- tree you can store both keys and data in the internal/leaf nodes. But in a B+ tree you have to store the data in the leaf nodes only. The principal advantage of B+ trees over B trees is they allow you to in pack more pointers to other nodes by removing pointers to data, thus increasing the fan-out and potentially decreasing the depth of the tree

B⁺   tree is a better tree structure than a B tree for implementation of an indexed sequential file .

In a B+ tree, in contrast to a B-tree, all records are stored at the leaf level of the tree; only keys are  

Please Share it! :)