undefined | Better HN

0 pointssaagarjha7y ago0 comments

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.

0 comments

jules7y ago

That's what I said.

j / k navigate · click thread line to collapse

0 pointssaagarjha7y ago0 comments

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.

0 comments

jules7y ago

That's what I said.

j / k navigate · click thread line to collapse