What is B+ Tree
content
Note
B+ Tree is a variant of B Tree, it has all the characteristics B Tree has.
B Tree has data entry in the interior nodes, B+ Tree only has data entry at the leaves.
Some characteristics of B+ Tree
- always balanced, even during insertion and deletion
- insertion and deletion are efficient
on top of being a B Tree, B+ Tree has following:
- actual data records are stored in leaf nodes
- internal nodes only store keys for navigation
- each node is at least half full (except root)
Additional feature:
- leaf nodes are linked together like a double linked list, allowing fast range queries