B Tree vs B+ Tree
B Tree vs B+ Tree
- B Tree
- B+ Tree
B Tree
A B Tree is a multi way search tree. A B tree of order n has maximum (n-1) keys and maximum n sons. In a B tree all leaves are at same level. Hence it is called balanced Tree.
Disadvantage of B Tree: Difficulty of traversing the keys sequentially.
B+ Tree
In B+ Tree all the keys are maintained in the leaves and the keys are replicated in the non-leaf nodes to define paths for locating individual records.The leaves are linked together to provide a sequential path for traversing the keys in the tree.