2min chapter

Software Engineering Radio - the podcast for professional software developers cover image

Episode 485: Howard Chu on B+tree Data Structure in Depth

Software Engineering Radio - the podcast for professional software developers

CHAPTER

A Nod Can Only Have Two Branches

If a binary tree is not balanced, then you don't get any advantage of the binary search peties yere. Youd be better off just going by t the original way in counting,. And so that's the most fundamental problem that motivated me ofthethe development of something like a bee tree. An live n ill enry tree. It's been around at least since t 19 70. See, i think the first, first published paper is 19 70, oneor 72. Ok. Just before we move on to what be tree issues solved, can we just revisit a root leaf and a note? Was that the right word? Root leaf? And they're all notes, right

00:00

Get the Snipd
podcast app

Unlock the knowledge in podcasts with the podcast player of the future.
App store bannerPlay store banner

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode

Save any
moment

Hear something you like? Tap your headphones to save it with AI-generated key takeaways

Share
& Export

Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more

AI-powered
podcast player

Listen to all your favourite podcasts with AI-powered features

Discover
highlights

Listen to the best highlights from the podcasts you love and dive into the full episode