What are the differences between B tree and B+ tree?

SNB TreeB+ Tree
1Search keys cannot repeatedly be stored.Redundant search keys can be present.
2Data can be stored in leaf nodes as well as internal nodesData can only be stored on the leaf nodes.
3Searching 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.
4Deletion 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.
5Leaf nodes cannot be linked together.Leaf nodes are linked together to make the search operations more efficient.