B-Tree vs. B+Tree
The original B-Tree from 1972 stored keys + values in all nodes in the tree.
-> More space efficient since each key only appears once in the tree
A B+ Tree only stores values in leaf nodes. Inner nodes only guide the search process.
Last updated