B- trees, B+ trees difference
- by dta
In a B- tree you can store both keys and data in the internal/leaf nodes.
But in a B+ tree you have to store the data in the leaf nodes only.
Is there any advantage of doing the above in a B+ tree?
Why not use B- trees instead of B+ trees everywhere?
As intuitively they seem much faster. I mean why do you need
to replicate the key(data) in a B+ tree?