B-trees are a popular data structure for storing large amounts of data, frequently seen in databases and file systems. But how do they really work? What makes them efficient? In this video, we explore the inner workings of the B-tree, aiming to understand the properties that make them useful and the elegant algorithms that make working with them possible.
***
Spanning Tree is an educational video series about computer science and mathematics. See more at
To be notified when a new video is released, sign up for the Spanning Tree mailing list at
You can support the Spanning Tree channel at
Spanning Tree is created by Brian Yu.
Email me at brian@spanningtree.me to suggest a future topic.
source
Good thing we as programmers don't have to maintain the B-Trees in our Apps
Such a great explanation!
The best video on B tree!
beautifully explained! thank you!❤
yea that sounds like brian
This was great.
This video inspired me to make my first proyect in c like a 9 months ago, now c is my favorite lenguaje 😀 ( besides c i only know python lol , i guess bash counts too? )
You should make one video on B+ trees as well
This is beautiful ❤️
The animations and the so didactic explanation make it a premium learning material. Congratulation and thank you, @Spanning Tree <3
Man, U r legend
This helps!! A LOT!!
Thank you
omfg this is so good !!!!!
this is a crazy good explanation
Man, this'll be a nightmare to code🫡
5:58 how did he predict the 67 meme
love you brooo, this was the best explanation for the topic I didn't even know existed before this video
6:02 67 (peak explanation)
your design is really amazing! it was super interesting to watch these little robots "performing" the operations, thanks a lot for this video!
Thank you so much, I learnt something new <3
I have been using B-tree indexed data bases since 1981 and still use them today. I always thought the "B" stood for balanced, not binary.
Excellent demonstration man! Very intuitive indeed.
Best video ever!!! Most straightforward explanation I have seen so far from the internet. Basically, B Tree is similar to quick sort which split raw data based on the pivot (the middle value) and managing (storing and deleting) these pivots.
67 at 5:55
0:00 : Describing binary search tree (BST)
2:30 : Describing B-Tree (construction, search)
4:40 : Insertion into a B-Tree
7:40 : Deletion from a B-Tree
6:10 67