SN | B Tree | B+ Tree |
---|---|---|
1 | Search keys cannot repeatedly be stored. | Redundant search keys can be present. |
2 | Data can be stored in leaf nodes as well as internal nodes | Data can only be stored on the leaf nodes. |
3 | Searching for some data is a slower process since data can be found on internal nodes as well as on the leaf nodes. | Searching is comparatively faster as data can only be found on the leaf nodes. |
4 | Deletion of internal nodes is so complicated and time-consuming. | Deletion will never be a complexed process since element will always be deleted from the leaf nodes. |
5 | Leaf nodes cannot be linked together. | Leaf nodes are linked together to make the search operations more efficient. |