Busying Oneself With B-Trees
Vaidehi Joshi
1.4K6

I recently came across your basecs series. I really like your enthusiasm and writing style! The way you present your topics reminds me of the joy and fascination I had in learning these same topics myself.

A suggestion for a future article: skip lists. They’re the magical mixture of linked lists and balanced trees. Looked at from one angle, they are linked lists with a way to improve per-operation performance from O(N) to O(lg N) probabalistically. Looked at from a different angle, they are trees that are probabalistically balanced.

Like what you read? Give Mark Day a round of applause.

From a quick cheer to a standing ovation, clap to show how much you enjoyed this story.