Data record is only key or Key+pointer to record/block
@shreyansh jain
Searching in B+ trees is faster because in B+ trees as we are storing record pointers in leaves only so in internal nodes fanout will be more hence height will be less hence searching time is less
A is an incorrect statement.
In a B tree search keys and data stored in internal or leaf nodes. But in B+-tree data store only leaf nodes.
Searching any data in a B+ tree is very easy because all data are found in leaf nodes. Searching a B tree requires a full traversal.
In a B tree, data may be found in leaf nodes or internal nodes. Deletion of internal nodes is very complicated. In a B+ tree, data is only found in leaf nodes. Deletion of leaf nodes is easy.
Insertion in B tree is more complicated than B+ tree.
B+ trees store redundant search key but B tree has no redundant value.
In a B+ tree, leaf nodes data are ordered as a sequential linked list but in B tree the leaf node cannot be stored using a linked list. Many database systems' implementations prefer the structural simplicity of a B+ tree.
Refer: https://stackoverflow.com/questions/870218/differences-between-b-trees-and-b-trees
64.3k questions
77.9k answers
244k comments
80.0k users