Coding Blocks cover image

Designing Data-Intensive Applications – SSTables and LSM-Trees

Coding Blocks

00:00

The Difference Between Red Black and a v L

i was thinking about, like, root o from an insert pointof yes, yes, you're always ging to start your root nod. How that stuff works is in the details. You end up crawling overe the node structure to get to the rest of it. And there was a big difference that they mentioned between red black and a v l. Therea got that o red black ar faster inserts and removal than a vL. Treeves because if they bastly, doa fewer rotations when things are being balanced. So their red black are more common, ok?

Play episode from 24:55
Transcript

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app