Hacker News new | ask | show | jobs
by saagarjha 2783 days ago
They are isomorphic, but B-Trees are more cache friendly. B-Trees store more in each node, while red-black trees require pointer chasing for each element.
1 comments

That's what I said.